./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c31a54802b36069ad17933a6a18dd94a6af410d31d2cd906e0e916fed918b284
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 21:12:54,161 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 21:12:54,201 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 21:12:54,205 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 21:12:54,205 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 21:12:54,222 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 21:12:54,223 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 21:12:54,224 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 21:12:54,224 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 21:12:54,224 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 21:12:54,225 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 21:12:54,225 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 21:12:54,226 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 21:12:54,226 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 21:12:54,226 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 21:12:54,227 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 21:12:54,227 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 21:12:54,228 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 21:12:54,228 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 21:12:54,228 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 21:12:54,229 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 21:12:54,229 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 21:12:54,229 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 21:12:54,230 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 21:12:54,230 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 21:12:54,230 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 21:12:54,231 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 21:12:54,231 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 21:12:54,231 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 21:12:54,232 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 21:12:54,232 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 21:12:54,232 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 21:12:54,233 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 21:12:54,233 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 21:12:54,233 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 21:12:54,234 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 21:12:54,234 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 21:12:54,234 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 21:12:54,234 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 21:12:54,235 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 21:12:54,235 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 21:12:54,235 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c31a54802b36069ad17933a6a18dd94a6af410d31d2cd906e0e916fed918b284
[2024-02-28 21:12:54,404 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 21:12:54,433 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 21:12:54,435 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 21:12:54,436 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 21:12:54,437 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 21:12:54,439 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-02-28 21:12:55,454 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 21:12:55,622 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 21:12:55,622 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2024-02-28 21:12:55,634 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/31db5d628/342a391bdba4405daa91a2ce0562c509/FLAG057a99d50
[2024-02-28 21:12:56,013 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/31db5d628/342a391bdba4405daa91a2ce0562c509
[2024-02-28 21:12:56,016 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 21:12:56,017 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 21:12:56,017 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 21:12:56,018 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 21:12:56,021 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 21:12:56,022 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,023 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4186d15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56, skipping insertion in model container
[2024-02-28 21:12:56,023 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,057 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 21:12:56,261 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 21:12:56,271 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 21:12:56,298 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 21:12:56,321 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 21:12:56,321 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56 WrapperNode
[2024-02-28 21:12:56,321 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 21:12:56,322 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 21:12:56,322 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 21:12:56,322 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 21:12:56,327 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,337 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,352 INFO  L138                Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54
[2024-02-28 21:12:56,353 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 21:12:56,353 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 21:12:56,353 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 21:12:56,353 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 21:12:56,360 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,360 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,362 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,363 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,367 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,369 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,370 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,371 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,373 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 21:12:56,374 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 21:12:56,374 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 21:12:56,374 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 21:12:56,375 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (1/1) ...
[2024-02-28 21:12:56,379 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 21:12:56,387 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:12:56,400 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-02-28 21:12:56,404 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-02-28 21:12:56,428 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 21:12:56,429 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 21:12:56,429 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-02-28 21:12:56,429 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 21:12:56,429 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 21:12:56,430 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 21:12:56,545 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 21:12:56,547 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 21:12:56,669 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 21:12:56,683 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 21:12:56,683 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 21:12:56,684 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:12:56 BoogieIcfgContainer
[2024-02-28 21:12:56,684 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 21:12:56,686 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 21:12:56,686 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 21:12:56,689 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 21:12:56,689 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 09:12:56" (1/3) ...
[2024-02-28 21:12:56,690 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e26cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 09:12:56, skipping insertion in model container
[2024-02-28 21:12:56,690 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:12:56" (2/3) ...
[2024-02-28 21:12:56,690 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e26cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 09:12:56, skipping insertion in model container
[2024-02-28 21:12:56,690 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:12:56" (3/3) ...
[2024-02-28 21:12:56,691 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i
[2024-02-28 21:12:56,697 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 21:12:56,704 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 21:12:56,705 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-02-28 21:12:56,705 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 21:12:56,740 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 21:12:56,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 149 flow
[2024-02-28 21:12:56,798 INFO  L124   PetriNetUnfolderBase]: 5/99 cut-off events.
[2024-02-28 21:12:56,798 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 21:12:56,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104 conditions, 99 events. 5/99 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 201 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. 
[2024-02-28 21:12:56,802 INFO  L82        GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 149 flow
[2024-02-28 21:12:56,805 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 149 flow
[2024-02-28 21:12:56,813 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:12:56,819 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57f2257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:12:56,819 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-02-28 21:12:56,828 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:12:56,828 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-02-28 21:12:56,828 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:12:56,828 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:56,829 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:56,830 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-02-28 21:12:56,833 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:56,834 INFO  L85        PathProgramCache]: Analyzing trace with hash -328016813, now seen corresponding path program 1 times
[2024-02-28 21:12:56,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:56,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067331787]
[2024-02-28 21:12:56,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:56,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:56,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:57,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:57,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:57,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067331787]
[2024-02-28 21:12:57,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067331787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:57,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:57,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 21:12:57,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234323229]
[2024-02-28 21:12:57,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:57,049 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 21:12:57,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:57,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 21:12:57,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 21:12:57,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 71
[2024-02-28 21:12:57,110 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 149 flow. Second operand  has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,110 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:57,110 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 71
[2024-02-28 21:12:57,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:57,164 INFO  L124   PetriNetUnfolderBase]: 8/158 cut-off events.
[2024-02-28 21:12:57,164 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-02-28 21:12:57,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 158 events. 8/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 439 event pairs, 0 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 133. Up to 17 conditions per place. 
[2024-02-28 21:12:57,166 INFO  L140   encePairwiseOnDemand]: 64/71 looper letters, 10 selfloop transitions, 4 changer transitions 1/73 dead transitions.
[2024-02-28 21:12:57,166 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 183 flow
[2024-02-28 21:12:57,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 21:12:57,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 21:12:57,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions.
[2024-02-28 21:12:57,176 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8838028169014085
[2024-02-28 21:12:57,176 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 251 transitions.
[2024-02-28 21:12:57,176 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 251 transitions.
[2024-02-28 21:12:57,177 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:57,179 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 251 transitions.
[2024-02-28 21:12:57,181 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,184 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,184 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,186 INFO  L175             Difference]: Start difference. First operand has 71 places, 71 transitions, 149 flow. Second operand 4 states and 251 transitions.
[2024-02-28 21:12:57,186 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 183 flow
[2024-02-28 21:12:57,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 183 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:12:57,190 INFO  L231             Difference]: Finished difference. Result has 75 places, 69 transitions, 157 flow
[2024-02-28 21:12:57,192 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=75, PETRI_TRANSITIONS=69}
[2024-02-28 21:12:57,194 INFO  L281   CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places.
[2024-02-28 21:12:57,194 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 157 flow
[2024-02-28 21:12:57,195 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,195 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:57,195 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:57,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 21:12:57,195 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-02-28 21:12:57,196 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:57,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -749003099, now seen corresponding path program 1 times
[2024-02-28 21:12:57,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:57,196 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396590904]
[2024-02-28 21:12:57,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:57,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:57,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:57,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:57,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:57,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396590904]
[2024-02-28 21:12:57,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396590904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:57,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:57,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:12:57,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956087823]
[2024-02-28 21:12:57,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:57,247 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:12:57,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:57,248 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:12:57,248 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:12:57,260 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 71
[2024-02-28 21:12:57,260 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 157 flow. Second operand  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,260 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:57,260 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 71
[2024-02-28 21:12:57,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:57,291 INFO  L124   PetriNetUnfolderBase]: 6/130 cut-off events.
[2024-02-28 21:12:57,291 INFO  L125   PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES.
[2024-02-28 21:12:57,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 130 events. 6/130 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 4 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 128. Up to 21 conditions per place. 
[2024-02-28 21:12:57,292 INFO  L140   encePairwiseOnDemand]: 66/71 looper letters, 9 selfloop transitions, 4 changer transitions 0/72 dead transitions.
[2024-02-28 21:12:57,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 189 flow
[2024-02-28 21:12:57,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:12:57,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:12:57,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions.
[2024-02-28 21:12:57,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8967136150234741
[2024-02-28 21:12:57,294 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 191 transitions.
[2024-02-28 21:12:57,294 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 191 transitions.
[2024-02-28 21:12:57,294 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:57,294 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 191 transitions.
[2024-02-28 21:12:57,295 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,296 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,297 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,297 INFO  L175             Difference]: Start difference. First operand has 75 places, 69 transitions, 157 flow. Second operand 3 states and 191 transitions.
[2024-02-28 21:12:57,297 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 189 flow
[2024-02-28 21:12:57,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 72 transitions, 181 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 21:12:57,299 INFO  L231             Difference]: Finished difference. Result has 76 places, 72 transitions, 179 flow
[2024-02-28 21:12:57,299 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=76, PETRI_TRANSITIONS=72}
[2024-02-28 21:12:57,300 INFO  L281   CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places.
[2024-02-28 21:12:57,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 179 flow
[2024-02-28 21:12:57,300 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,300 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:57,300 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:57,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 21:12:57,301 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-02-28 21:12:57,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:57,301 INFO  L85        PathProgramCache]: Analyzing trace with hash -155908587, now seen corresponding path program 1 times
[2024-02-28 21:12:57,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:57,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586584928]
[2024-02-28 21:12:57,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:57,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:57,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:12:57,321 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:12:57,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:12:57,348 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:12:57,348 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:12:57,349 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2024-02-28 21:12:57,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2024-02-28 21:12:57,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2024-02-28 21:12:57,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2024-02-28 21:12:57,351 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2024-02-28 21:12:57,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 21:12:57,352 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-02-28 21:12:57,354 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 21:12:57,354 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 21:12:57,372 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 21:12:57,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 194 flow
[2024-02-28 21:12:57,393 INFO  L124   PetriNetUnfolderBase]: 10/180 cut-off events.
[2024-02-28 21:12:57,393 INFO  L125   PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES.
[2024-02-28 21:12:57,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 180 events. 10/180 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 470 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place. 
[2024-02-28 21:12:57,394 INFO  L82        GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 194 flow
[2024-02-28 21:12:57,395 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 194 flow
[2024-02-28 21:12:57,396 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:12:57,397 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57f2257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:12:57,397 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-02-28 21:12:57,400 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:12:57,400 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-02-28 21:12:57,400 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:12:57,400 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:57,400 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:57,400 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-02-28 21:12:57,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:57,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -1646010701, now seen corresponding path program 1 times
[2024-02-28 21:12:57,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:57,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486462447]
[2024-02-28 21:12:57,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:57,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:57,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:57,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:57,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:57,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486462447]
[2024-02-28 21:12:57,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486462447] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:57,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:57,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 21:12:57,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031400917]
[2024-02-28 21:12:57,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:57,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 21:12:57,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:57,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 21:12:57,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 21:12:57,483 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-02-28 21:12:57,484 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 194 flow. Second operand  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,484 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:57,484 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-02-28 21:12:57,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:57,564 INFO  L124   PetriNetUnfolderBase]: 72/568 cut-off events.
[2024-02-28 21:12:57,564 INFO  L125   PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES.
[2024-02-28 21:12:57,566 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 734 conditions, 568 events. 72/568 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3512 event pairs, 20 based on Foata normal form. 16/535 useless extension candidates. Maximal degree in co-relation 189. Up to 106 conditions per place. 
[2024-02-28 21:12:57,568 INFO  L140   encePairwiseOnDemand]: 82/89 looper letters, 18 selfloop transitions, 4 changer transitions 0/94 dead transitions.
[2024-02-28 21:12:57,568 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 248 flow
[2024-02-28 21:12:57,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 21:12:57,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 21:12:57,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions.
[2024-02-28 21:12:57,570 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8820224719101124
[2024-02-28 21:12:57,570 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 314 transitions.
[2024-02-28 21:12:57,570 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 314 transitions.
[2024-02-28 21:12:57,570 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:57,570 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 314 transitions.
[2024-02-28 21:12:57,572 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,573 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,573 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,573 INFO  L175             Difference]: Start difference. First operand has 90 places, 89 transitions, 194 flow. Second operand 4 states and 314 transitions.
[2024-02-28 21:12:57,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 248 flow
[2024-02-28 21:12:57,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:12:57,576 INFO  L231             Difference]: Finished difference. Result has 94 places, 88 transitions, 206 flow
[2024-02-28 21:12:57,576 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=94, PETRI_TRANSITIONS=88}
[2024-02-28 21:12:57,576 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places.
[2024-02-28 21:12:57,576 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 206 flow
[2024-02-28 21:12:57,577 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,577 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:57,577 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:57,577 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 21:12:57,577 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-02-28 21:12:57,578 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:57,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -853170898, now seen corresponding path program 1 times
[2024-02-28 21:12:57,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:57,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582915050]
[2024-02-28 21:12:57,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:57,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:57,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:57,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:57,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:57,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582915050]
[2024-02-28 21:12:57,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582915050] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:57,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:57,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:12:57,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041861188]
[2024-02-28 21:12:57,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:57,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:12:57,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:57,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:12:57,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:12:57,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-02-28 21:12:57,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 206 flow. Second operand  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:57,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-02-28 21:12:57,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:57,715 INFO  L124   PetriNetUnfolderBase]: 116/699 cut-off events.
[2024-02-28 21:12:57,716 INFO  L125   PetriNetUnfolderBase]: For 76/107 co-relation queries the response was YES.
[2024-02-28 21:12:57,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 991 conditions, 699 events. 116/699 cut-off events. For 76/107 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4637 event pairs, 52 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 921. Up to 185 conditions per place. 
[2024-02-28 21:12:57,720 INFO  L140   encePairwiseOnDemand]: 83/89 looper letters, 18 selfloop transitions, 5 changer transitions 0/96 dead transitions.
[2024-02-28 21:12:57,720 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 276 flow
[2024-02-28 21:12:57,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:12:57,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:12:57,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions.
[2024-02-28 21:12:57,722 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.898876404494382
[2024-02-28 21:12:57,722 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 240 transitions.
[2024-02-28 21:12:57,722 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 240 transitions.
[2024-02-28 21:12:57,722 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:57,722 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 240 transitions.
[2024-02-28 21:12:57,723 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,724 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,724 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,724 INFO  L175             Difference]: Start difference. First operand has 94 places, 88 transitions, 206 flow. Second operand 3 states and 240 transitions.
[2024-02-28 21:12:57,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 276 flow
[2024-02-28 21:12:57,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:12:57,727 INFO  L231             Difference]: Finished difference. Result has 96 places, 92 transitions, 238 flow
[2024-02-28 21:12:57,727 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=96, PETRI_TRANSITIONS=92}
[2024-02-28 21:12:57,727 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places.
[2024-02-28 21:12:57,728 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 238 flow
[2024-02-28 21:12:57,728 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:57,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:57,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 21:12:57,728 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-02-28 21:12:57,729 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:57,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -1480076718, now seen corresponding path program 1 times
[2024-02-28 21:12:57,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:57,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388581991]
[2024-02-28 21:12:57,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:57,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:57,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:57,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 21:12:57,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:57,781 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388581991]
[2024-02-28 21:12:57,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388581991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:57,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:57,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 21:12:57,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950976966]
[2024-02-28 21:12:57,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:57,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 21:12:57,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:57,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 21:12:57,783 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 21:12:57,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-02-28 21:12:57,823 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 238 flow. Second operand  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:57,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-02-28 21:12:57,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:57,902 INFO  L124   PetriNetUnfolderBase]: 63/581 cut-off events.
[2024-02-28 21:12:57,902 INFO  L125   PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES.
[2024-02-28 21:12:57,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 811 conditions, 581 events. 63/581 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3341 event pairs, 24 based on Foata normal form. 15/545 useless extension candidates. Maximal degree in co-relation 651. Up to 72 conditions per place. 
[2024-02-28 21:12:57,905 INFO  L140   encePairwiseOnDemand]: 84/89 looper letters, 19 selfloop transitions, 4 changer transitions 3/103 dead transitions.
[2024-02-28 21:12:57,905 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 318 flow
[2024-02-28 21:12:57,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 21:12:57,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 21:12:57,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions.
[2024-02-28 21:12:57,906 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8848314606741573
[2024-02-28 21:12:57,906 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 315 transitions.
[2024-02-28 21:12:57,906 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 315 transitions.
[2024-02-28 21:12:57,906 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:57,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 315 transitions.
[2024-02-28 21:12:57,907 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,908 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,908 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,909 INFO  L175             Difference]: Start difference. First operand has 96 places, 92 transitions, 238 flow. Second operand 4 states and 315 transitions.
[2024-02-28 21:12:57,909 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 318 flow
[2024-02-28 21:12:57,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:12:57,911 INFO  L231             Difference]: Finished difference. Result has 98 places, 93 transitions, 244 flow
[2024-02-28 21:12:57,911 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=93}
[2024-02-28 21:12:57,912 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places.
[2024-02-28 21:12:57,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 244 flow
[2024-02-28 21:12:57,912 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:57,912 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:57,912 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:57,912 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 21:12:57,913 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-02-28 21:12:57,913 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:57,913 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931209736, now seen corresponding path program 1 times
[2024-02-28 21:12:57,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:57,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359364552]
[2024-02-28 21:12:57,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:57,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:57,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:57,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:57,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:57,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359364552]
[2024-02-28 21:12:57,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359364552] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:12:57,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286342580]
[2024-02-28 21:12:57,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:58,000 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:12:58,000 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:12:58,002 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:12:58,010 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 21:12:58,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:58,083 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-02-28 21:12:58,085 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:12:58,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:58,182 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 21:12:58,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:58,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [286342580] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 21:12:58,235 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 21:12:58,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-02-28 21:12:58,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228674656]
[2024-02-28 21:12:58,235 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 21:12:58,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-02-28 21:12:58,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:58,236 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-02-28 21:12:58,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-02-28 21:12:58,324 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89
[2024-02-28 21:12:58,325 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 244 flow. Second operand  has 13 states, 13 states have (on average 70.92307692307692) internal successors, (922), 13 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,325 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:58,325 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89
[2024-02-28 21:12:58,325 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:58,469 INFO  L124   PetriNetUnfolderBase]: 81/351 cut-off events.
[2024-02-28 21:12:58,469 INFO  L125   PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2024-02-28 21:12:58,470 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 558 conditions, 351 events. 81/351 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1830 event pairs, 6 based on Foata normal form. 15/347 useless extension candidates. Maximal degree in co-relation 550. Up to 56 conditions per place. 
[2024-02-28 21:12:58,471 INFO  L140   encePairwiseOnDemand]: 83/89 looper letters, 28 selfloop transitions, 8 changer transitions 0/85 dead transitions.
[2024-02-28 21:12:58,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 276 flow
[2024-02-28 21:12:58,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 21:12:58,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 21:12:58,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 728 transitions.
[2024-02-28 21:12:58,473 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8179775280898877
[2024-02-28 21:12:58,473 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 728 transitions.
[2024-02-28 21:12:58,473 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 728 transitions.
[2024-02-28 21:12:58,474 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:58,474 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 728 transitions.
[2024-02-28 21:12:58,475 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 72.8) internal successors, (728), 10 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,477 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,477 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,477 INFO  L175             Difference]: Start difference. First operand has 98 places, 93 transitions, 244 flow. Second operand 10 states and 728 transitions.
[2024-02-28 21:12:58,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 276 flow
[2024-02-28 21:12:58,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 21:12:58,479 INFO  L231             Difference]: Finished difference. Result has 79 places, 65 transitions, 179 flow
[2024-02-28 21:12:58,479 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=79, PETRI_TRANSITIONS=65}
[2024-02-28 21:12:58,480 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, -11 predicate places.
[2024-02-28 21:12:58,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 179 flow
[2024-02-28 21:12:58,480 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 70.92307692307692) internal successors, (922), 13 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:58,480 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:58,489 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 21:12:58,683 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:12:58,684 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-02-28 21:12:58,684 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:58,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -778921506, now seen corresponding path program 1 times
[2024-02-28 21:12:58,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:58,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590592313]
[2024-02-28 21:12:58,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:58,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:58,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:58,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-02-28 21:12:58,731 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:58,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590592313]
[2024-02-28 21:12:58,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590592313] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:58,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:58,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:12:58,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934697735]
[2024-02-28 21:12:58,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:58,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:12:58,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:58,738 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:12:58,738 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:12:58,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89
[2024-02-28 21:12:58,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 179 flow. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:58,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89
[2024-02-28 21:12:58,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:58,784 INFO  L124   PetriNetUnfolderBase]: 27/209 cut-off events.
[2024-02-28 21:12:58,786 INFO  L125   PetriNetUnfolderBase]: For 27/31 co-relation queries the response was YES.
[2024-02-28 21:12:58,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 348 conditions, 209 events. 27/209 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 799 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 340. Up to 55 conditions per place. 
[2024-02-28 21:12:58,787 INFO  L140   encePairwiseOnDemand]: 84/89 looper letters, 13 selfloop transitions, 5 changer transitions 0/70 dead transitions.
[2024-02-28 21:12:58,787 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 70 transitions, 227 flow
[2024-02-28 21:12:58,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:12:58,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:12:58,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions.
[2024-02-28 21:12:58,788 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8764044943820225
[2024-02-28 21:12:58,788 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 234 transitions.
[2024-02-28 21:12:58,788 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions.
[2024-02-28 21:12:58,788 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:58,788 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions.
[2024-02-28 21:12:58,789 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,789 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,789 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,789 INFO  L175             Difference]: Start difference. First operand has 79 places, 65 transitions, 179 flow. Second operand 3 states and 234 transitions.
[2024-02-28 21:12:58,790 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 70 transitions, 227 flow
[2024-02-28 21:12:58,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 210 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-02-28 21:12:58,792 INFO  L231             Difference]: Finished difference. Result has 77 places, 68 transitions, 198 flow
[2024-02-28 21:12:58,792 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=77, PETRI_TRANSITIONS=68}
[2024-02-28 21:12:58,793 INFO  L281   CegarLoopForPetriNet]: 90 programPoint places, -13 predicate places.
[2024-02-28 21:12:58,793 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 198 flow
[2024-02-28 21:12:58,794 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,794 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:58,794 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:58,794 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 21:12:58,794 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-02-28 21:12:58,794 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:58,794 INFO  L85        PathProgramCache]: Analyzing trace with hash 1306650741, now seen corresponding path program 1 times
[2024-02-28 21:12:58,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:58,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787533545]
[2024-02-28 21:12:58,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:58,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:58,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:12:58,813 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:12:58,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:12:58,833 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:12:58,834 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:12:58,834 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2024-02-28 21:12:58,834 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2024-02-28 21:12:58,835 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2024-02-28 21:12:58,835 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2024-02-28 21:12:58,835 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2024-02-28 21:12:58,835 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2024-02-28 21:12:58,835 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 21:12:58,835 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:58,836 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 21:12:58,836 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-02-28 21:12:58,864 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-02-28 21:12:58,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 109 places, 107 transitions, 241 flow
[2024-02-28 21:12:58,889 INFO  L124   PetriNetUnfolderBase]: 20/314 cut-off events.
[2024-02-28 21:12:58,889 INFO  L125   PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES.
[2024-02-28 21:12:58,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 339 conditions, 314 events. 20/314 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 996 event pairs, 1 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 188. Up to 16 conditions per place. 
[2024-02-28 21:12:58,890 INFO  L82        GeneralOperation]: Start removeDead. Operand has 109 places, 107 transitions, 241 flow
[2024-02-28 21:12:58,892 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 109 places, 107 transitions, 241 flow
[2024-02-28 21:12:58,893 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:12:58,894 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57f2257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:12:58,894 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-02-28 21:12:58,896 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:12:58,896 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-02-28 21:12:58,896 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:12:58,896 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:58,896 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:58,897 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:12:58,897 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:58,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 2077821395, now seen corresponding path program 1 times
[2024-02-28 21:12:58,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:58,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673062076]
[2024-02-28 21:12:58,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:58,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:58,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:58,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:58,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:58,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673062076]
[2024-02-28 21:12:58,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673062076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:58,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:58,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 21:12:58,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064866724]
[2024-02-28 21:12:58,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:58,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 21:12:58,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:58,944 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 21:12:58,944 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 21:12:58,963 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107
[2024-02-28 21:12:58,963 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 241 flow. Second operand  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:58,963 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:58,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107
[2024-02-28 21:12:58,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:59,176 INFO  L124   PetriNetUnfolderBase]: 412/2191 cut-off events.
[2024-02-28 21:12:59,177 INFO  L125   PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES.
[2024-02-28 21:12:59,180 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 2191 events. 412/2191 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 18620 event pairs, 175 based on Foata normal form. 63/2061 useless extension candidates. Maximal degree in co-relation 757. Up to 495 conditions per place. 
[2024-02-28 21:12:59,186 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 24 selfloop transitions, 4 changer transitions 0/114 dead transitions.
[2024-02-28 21:12:59,186 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 114 transitions, 311 flow
[2024-02-28 21:12:59,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 21:12:59,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 21:12:59,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions.
[2024-02-28 21:12:59,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8785046728971962
[2024-02-28 21:12:59,188 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 376 transitions.
[2024-02-28 21:12:59,188 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions.
[2024-02-28 21:12:59,188 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:59,188 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions.
[2024-02-28 21:12:59,189 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,190 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,190 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,190 INFO  L175             Difference]: Start difference. First operand has 109 places, 107 transitions, 241 flow. Second operand 4 states and 376 transitions.
[2024-02-28 21:12:59,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 114 transitions, 311 flow
[2024-02-28 21:12:59,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 311 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:12:59,192 INFO  L231             Difference]: Finished difference. Result has 113 places, 106 transitions, 253 flow
[2024-02-28 21:12:59,192 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=113, PETRI_TRANSITIONS=106}
[2024-02-28 21:12:59,192 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places.
[2024-02-28 21:12:59,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 253 flow
[2024-02-28 21:12:59,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:59,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:59,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 21:12:59,193 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:12:59,193 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:59,193 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019156887, now seen corresponding path program 1 times
[2024-02-28 21:12:59,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:59,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066428448]
[2024-02-28 21:12:59,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:59,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:59,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:59,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:12:59,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:59,213 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066428448]
[2024-02-28 21:12:59,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066428448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:59,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:59,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:12:59,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417763681]
[2024-02-28 21:12:59,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:59,213 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:12:59,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:59,214 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:12:59,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:12:59,229 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-02-28 21:12:59,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 253 flow. Second operand  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:59,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-02-28 21:12:59,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:12:59,639 INFO  L124   PetriNetUnfolderBase]: 1023/4264 cut-off events.
[2024-02-28 21:12:59,639 INFO  L125   PetriNetUnfolderBase]: For 720/933 co-relation queries the response was YES.
[2024-02-28 21:12:59,648 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6254 conditions, 4264 events. 1023/4264 cut-off events. For 720/933 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 41775 event pairs, 560 based on Foata normal form. 1/3721 useless extension candidates. Maximal degree in co-relation 6048. Up to 1329 conditions per place. 
[2024-02-28 21:12:59,665 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 27 selfloop transitions, 6 changer transitions 0/119 dead transitions.
[2024-02-28 21:12:59,665 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 363 flow
[2024-02-28 21:12:59,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:12:59,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:12:59,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions.
[2024-02-28 21:12:59,666 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9003115264797508
[2024-02-28 21:12:59,666 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 289 transitions.
[2024-02-28 21:12:59,666 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions.
[2024-02-28 21:12:59,666 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:12:59,667 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions.
[2024-02-28 21:12:59,667 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,668 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,668 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,668 INFO  L175             Difference]: Start difference. First operand has 113 places, 106 transitions, 253 flow. Second operand 3 states and 289 transitions.
[2024-02-28 21:12:59,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 363 flow
[2024-02-28 21:12:59,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:12:59,672 INFO  L231             Difference]: Finished difference. Result has 115 places, 111 transitions, 293 flow
[2024-02-28 21:12:59,672 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=115, PETRI_TRANSITIONS=111}
[2024-02-28 21:12:59,672 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places.
[2024-02-28 21:12:59,673 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 293 flow
[2024-02-28 21:12:59,673 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,673 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:12:59,673 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:12:59,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 21:12:59,673 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:12:59,673 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:12:59,673 INFO  L85        PathProgramCache]: Analyzing trace with hash -1650732958, now seen corresponding path program 1 times
[2024-02-28 21:12:59,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:12:59,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691006130]
[2024-02-28 21:12:59,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:12:59,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:12:59,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:12:59,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 21:12:59,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:12:59,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691006130]
[2024-02-28 21:12:59,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691006130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:12:59,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:12:59,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 21:12:59,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571670970]
[2024-02-28 21:12:59,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:12:59,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 21:12:59,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:12:59,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 21:12:59,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 21:12:59,752 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107
[2024-02-28 21:12:59,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 293 flow. Second operand  has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:12:59,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:12:59,753 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107
[2024-02-28 21:12:59,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:00,152 INFO  L124   PetriNetUnfolderBase]: 618/3166 cut-off events.
[2024-02-28 21:13:00,153 INFO  L125   PetriNetUnfolderBase]: For 436/440 co-relation queries the response was YES.
[2024-02-28 21:13:00,159 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4697 conditions, 3166 events. 618/3166 cut-off events. For 436/440 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29550 event pairs, 247 based on Foata normal form. 63/2905 useless extension candidates. Maximal degree in co-relation 3847. Up to 511 conditions per place. 
[2024-02-28 21:13:00,169 INFO  L140   encePairwiseOnDemand]: 102/107 looper letters, 31 selfloop transitions, 4 changer transitions 0/127 dead transitions.
[2024-02-28 21:13:00,169 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 127 transitions, 404 flow
[2024-02-28 21:13:00,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 21:13:00,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 21:13:00,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions.
[2024-02-28 21:13:00,171 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8878504672897196
[2024-02-28 21:13:00,171 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 380 transitions.
[2024-02-28 21:13:00,171 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions.
[2024-02-28 21:13:00,171 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:00,171 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions.
[2024-02-28 21:13:00,172 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:00,173 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:00,173 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:00,173 INFO  L175             Difference]: Start difference. First operand has 115 places, 111 transitions, 293 flow. Second operand 4 states and 380 transitions.
[2024-02-28 21:13:00,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 127 transitions, 404 flow
[2024-02-28 21:13:00,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 127 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:00,176 INFO  L231             Difference]: Finished difference. Result has 117 places, 112 transitions, 297 flow
[2024-02-28 21:13:00,177 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=117, PETRI_TRANSITIONS=112}
[2024-02-28 21:13:00,177 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places.
[2024-02-28 21:13:00,177 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 297 flow
[2024-02-28 21:13:00,177 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:00,177 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:00,178 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:00,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 21:13:00,178 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:13:00,178 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:00,178 INFO  L85        PathProgramCache]: Analyzing trace with hash -709870861, now seen corresponding path program 1 times
[2024-02-28 21:13:00,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:00,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274896366]
[2024-02-28 21:13:00,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:00,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:00,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:00,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:00,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:00,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274896366]
[2024-02-28 21:13:00,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274896366] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:13:00,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996824363]
[2024-02-28 21:13:00,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:00,249 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:00,250 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:13:00,250 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:13:00,251 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 21:13:00,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:00,345 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-02-28 21:13:00,348 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:13:00,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:00,427 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 21:13:00,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:00,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996824363] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 21:13:00,475 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 21:13:00,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-02-28 21:13:00,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185305421]
[2024-02-28 21:13:00,475 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 21:13:00,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-02-28 21:13:00,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:00,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-02-28 21:13:00,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-02-28 21:13:00,532 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107
[2024-02-28 21:13:00,533 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 297 flow. Second operand  has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:00,533 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:00,533 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107
[2024-02-28 21:13:00,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:01,055 INFO  L124   PetriNetUnfolderBase]: 1016/4333 cut-off events.
[2024-02-28 21:13:01,056 INFO  L125   PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES.
[2024-02-28 21:13:01,065 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 4333 events. 1016/4333 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 40757 event pairs, 151 based on Foata normal form. 15/3810 useless extension candidates. Maximal degree in co-relation 3426. Up to 749 conditions per place. 
[2024-02-28 21:13:01,077 INFO  L140   encePairwiseOnDemand]: 99/107 looper letters, 50 selfloop transitions, 11 changer transitions 0/150 dead transitions.
[2024-02-28 21:13:01,077 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 150 transitions, 497 flow
[2024-02-28 21:13:01,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 21:13:01,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 21:13:01,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 893 transitions.
[2024-02-28 21:13:01,080 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8345794392523365
[2024-02-28 21:13:01,080 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 893 transitions.
[2024-02-28 21:13:01,080 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 893 transitions.
[2024-02-28 21:13:01,081 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:01,081 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 893 transitions.
[2024-02-28 21:13:01,082 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 89.3) internal successors, (893), 10 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,084 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,084 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,084 INFO  L175             Difference]: Start difference. First operand has 117 places, 112 transitions, 297 flow. Second operand 10 states and 893 transitions.
[2024-02-28 21:13:01,084 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 150 transitions, 497 flow
[2024-02-28 21:13:01,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 150 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:01,089 INFO  L231             Difference]: Finished difference. Result has 127 places, 118 transitions, 347 flow
[2024-02-28 21:13:01,089 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=127, PETRI_TRANSITIONS=118}
[2024-02-28 21:13:01,090 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 18 predicate places.
[2024-02-28 21:13:01,090 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 347 flow
[2024-02-28 21:13:01,090 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,090 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:01,090 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:01,096 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 21:13:01,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-02-28 21:13:01,296 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:13:01,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:01,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 1047928841, now seen corresponding path program 1 times
[2024-02-28 21:13:01,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:01,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817751633]
[2024-02-28 21:13:01,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:01,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:01,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:01,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-02-28 21:13:01,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:01,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817751633]
[2024-02-28 21:13:01,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817751633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:01,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:01,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:13:01,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324094496]
[2024-02-28 21:13:01,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:01,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:01,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:01,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:01,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:01,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-02-28 21:13:01,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 347 flow. Second operand  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:01,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-02-28 21:13:01,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:01,713 INFO  L124   PetriNetUnfolderBase]: 916/4000 cut-off events.
[2024-02-28 21:13:01,713 INFO  L125   PetriNetUnfolderBase]: For 1214/1242 co-relation queries the response was YES.
[2024-02-28 21:13:01,722 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 4000 events. 916/4000 cut-off events. For 1214/1242 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 38755 event pairs, 539 based on Foata normal form. 1/3627 useless extension candidates. Maximal degree in co-relation 6142. Up to 1192 conditions per place. 
[2024-02-28 21:13:01,733 INFO  L140   encePairwiseOnDemand]: 100/107 looper letters, 28 selfloop transitions, 9 changer transitions 0/132 dead transitions.
[2024-02-28 21:13:01,733 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 472 flow
[2024-02-28 21:13:01,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:01,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:01,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions.
[2024-02-28 21:13:01,735 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.897196261682243
[2024-02-28 21:13:01,735 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 288 transitions.
[2024-02-28 21:13:01,735 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions.
[2024-02-28 21:13:01,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:01,736 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions.
[2024-02-28 21:13:01,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,737 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,737 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,737 INFO  L175             Difference]: Start difference. First operand has 127 places, 118 transitions, 347 flow. Second operand 3 states and 288 transitions.
[2024-02-28 21:13:01,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 472 flow
[2024-02-28 21:13:01,740 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 132 transitions, 464 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:01,741 INFO  L231             Difference]: Finished difference. Result has 129 places, 125 transitions, 415 flow
[2024-02-28 21:13:01,742 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=129, PETRI_TRANSITIONS=125}
[2024-02-28 21:13:01,742 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places.
[2024-02-28 21:13:01,742 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 415 flow
[2024-02-28 21:13:01,742 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,742 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:01,743 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:01,743 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-02-28 21:13:01,743 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:13:01,743 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:01,743 INFO  L85        PathProgramCache]: Analyzing trace with hash -1375263459, now seen corresponding path program 1 times
[2024-02-28 21:13:01,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:01,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750457407]
[2024-02-28 21:13:01,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:01,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:01,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:01,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-02-28 21:13:01,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:01,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750457407]
[2024-02-28 21:13:01,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750457407] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:01,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:01,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 21:13:01,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483043514]
[2024-02-28 21:13:01,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:01,802 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:01,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:01,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:01,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:01,811 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 107
[2024-02-28 21:13:01,811 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 415 flow. Second operand  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,811 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:01,811 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 107
[2024-02-28 21:13:01,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:01,949 INFO  L124   PetriNetUnfolderBase]: 98/1340 cut-off events.
[2024-02-28 21:13:01,949 INFO  L125   PetriNetUnfolderBase]: For 340/382 co-relation queries the response was YES.
[2024-02-28 21:13:01,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1340 events. 98/1340 cut-off events. For 340/382 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10118 event pairs, 26 based on Foata normal form. 20/1253 useless extension candidates. Maximal degree in co-relation 922. Up to 100 conditions per place. 
[2024-02-28 21:13:01,955 INFO  L140   encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 6 changer transitions 0/124 dead transitions.
[2024-02-28 21:13:01,955 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 436 flow
[2024-02-28 21:13:01,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:01,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:01,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions.
[2024-02-28 21:13:01,957 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9252336448598131
[2024-02-28 21:13:01,957 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 297 transitions.
[2024-02-28 21:13:01,957 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions.
[2024-02-28 21:13:01,957 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:01,957 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions.
[2024-02-28 21:13:01,958 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,959 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,959 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,959 INFO  L175             Difference]: Start difference. First operand has 129 places, 125 transitions, 415 flow. Second operand 3 states and 297 transitions.
[2024-02-28 21:13:01,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 436 flow
[2024-02-28 21:13:01,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 424 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:01,962 INFO  L231             Difference]: Finished difference. Result has 129 places, 119 transitions, 369 flow
[2024-02-28 21:13:01,962 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=129, PETRI_TRANSITIONS=119}
[2024-02-28 21:13:01,963 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places.
[2024-02-28 21:13:01,963 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 119 transitions, 369 flow
[2024-02-28 21:13:01,963 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:01,963 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:01,964 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:01,964 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 21:13:01,964 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:13:01,964 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:01,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -364070712, now seen corresponding path program 1 times
[2024-02-28 21:13:01,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:01,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783179612]
[2024-02-28 21:13:01,965 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:01,965 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:01,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:01,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-02-28 21:13:01,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:01,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783179612]
[2024-02-28 21:13:01,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783179612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:01,990 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:01,990 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:13:01,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303366832]
[2024-02-28 21:13:01,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:01,991 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:01,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:01,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:01,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:02,006 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107
[2024-02-28 21:13:02,006 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 369 flow. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:02,006 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:02,006 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107
[2024-02-28 21:13:02,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:02,148 INFO  L124   PetriNetUnfolderBase]: 177/1400 cut-off events.
[2024-02-28 21:13:02,148 INFO  L125   PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES.
[2024-02-28 21:13:02,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1400 events. 177/1400 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11059 event pairs, 135 based on Foata normal form. 0/1290 useless extension candidates. Maximal degree in co-relation 2169. Up to 336 conditions per place. 
[2024-02-28 21:13:02,154 INFO  L140   encePairwiseOnDemand]: 102/107 looper letters, 23 selfloop transitions, 4 changer transitions 0/124 dead transitions.
[2024-02-28 21:13:02,155 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 443 flow
[2024-02-28 21:13:02,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:02,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:02,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions.
[2024-02-28 21:13:02,156 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8753894080996885
[2024-02-28 21:13:02,156 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 281 transitions.
[2024-02-28 21:13:02,156 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions.
[2024-02-28 21:13:02,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:02,156 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions.
[2024-02-28 21:13:02,157 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:02,157 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:02,158 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:02,158 INFO  L175             Difference]: Start difference. First operand has 129 places, 119 transitions, 369 flow. Second operand 3 states and 281 transitions.
[2024-02-28 21:13:02,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 443 flow
[2024-02-28 21:13:02,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 124 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 21:13:02,161 INFO  L231             Difference]: Finished difference. Result has 132 places, 122 transitions, 397 flow
[2024-02-28 21:13:02,161 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=132, PETRI_TRANSITIONS=122}
[2024-02-28 21:13:02,162 INFO  L281   CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places.
[2024-02-28 21:13:02,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 397 flow
[2024-02-28 21:13:02,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:02,162 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:02,162 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:02,162 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-02-28 21:13:02,162 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-02-28 21:13:02,163 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:02,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -1107906250, now seen corresponding path program 1 times
[2024-02-28 21:13:02,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:02,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721796634]
[2024-02-28 21:13:02,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:02,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:02,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:13:02,174 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:13:02,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:13:02,184 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:13:02,185 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:13:02,185 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-02-28 21:13:02,185 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-02-28 21:13:02,185 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-02-28 21:13:02,185 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-02-28 21:13:02,185 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-02-28 21:13:02,185 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-02-28 21:13:02,186 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-02-28 21:13:02,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-02-28 21:13:02,186 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:02,186 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 21:13:02,186 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-02-28 21:13:02,227 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-02-28 21:13:02,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 290 flow
[2024-02-28 21:13:02,264 INFO  L124   PetriNetUnfolderBase]: 42/556 cut-off events.
[2024-02-28 21:13:02,264 INFO  L125   PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES.
[2024-02-28 21:13:02,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 607 conditions, 556 events. 42/556 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2238 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 334. Up to 32 conditions per place. 
[2024-02-28 21:13:02,265 INFO  L82        GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 290 flow
[2024-02-28 21:13:02,267 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 290 flow
[2024-02-28 21:13:02,267 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:13:02,268 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57f2257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:13:02,268 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-02-28 21:13:02,269 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:13:02,269 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-02-28 21:13:02,270 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:13:02,270 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:02,270 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:02,270 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:02,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:02,270 INFO  L85        PathProgramCache]: Analyzing trace with hash -2041422413, now seen corresponding path program 1 times
[2024-02-28 21:13:02,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:02,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062475649]
[2024-02-28 21:13:02,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:02,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:02,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:02,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:02,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:02,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062475649]
[2024-02-28 21:13:02,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062475649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:02,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:02,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 21:13:02,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027994057]
[2024-02-28 21:13:02,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:02,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 21:13:02,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:02,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 21:13:02,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 21:13:02,312 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-02-28 21:13:02,312 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 290 flow. Second operand  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:02,313 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:02,313 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-02-28 21:13:02,313 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:02,959 INFO  L124   PetriNetUnfolderBase]: 2015/8288 cut-off events.
[2024-02-28 21:13:02,959 INFO  L125   PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES.
[2024-02-28 21:13:02,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11683 conditions, 8288 events. 2015/8288 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 87488 event pairs, 996 based on Foata normal form. 245/7797 useless extension candidates. Maximal degree in co-relation 3032. Up to 2117 conditions per place. 
[2024-02-28 21:13:03,005 INFO  L140   encePairwiseOnDemand]: 118/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/134 dead transitions.
[2024-02-28 21:13:03,005 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 376 flow
[2024-02-28 21:13:03,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 21:13:03,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 21:13:03,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions.
[2024-02-28 21:13:03,006 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.876
[2024-02-28 21:13:03,006 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 438 transitions.
[2024-02-28 21:13:03,007 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions.
[2024-02-28 21:13:03,007 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:03,007 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions.
[2024-02-28 21:13:03,008 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:03,009 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:03,009 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:03,009 INFO  L175             Difference]: Start difference. First operand has 128 places, 125 transitions, 290 flow. Second operand 4 states and 438 transitions.
[2024-02-28 21:13:03,009 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 376 flow
[2024-02-28 21:13:03,010 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 376 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:13:03,011 INFO  L231             Difference]: Finished difference. Result has 132 places, 124 transitions, 302 flow
[2024-02-28 21:13:03,012 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=124}
[2024-02-28 21:13:03,012 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places.
[2024-02-28 21:13:03,012 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 124 transitions, 302 flow
[2024-02-28 21:13:03,012 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:03,012 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:03,012 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:03,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-02-28 21:13:03,013 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:03,013 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:03,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 572042246, now seen corresponding path program 1 times
[2024-02-28 21:13:03,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:03,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545193025]
[2024-02-28 21:13:03,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:03,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:03,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:03,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:03,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:03,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545193025]
[2024-02-28 21:13:03,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545193025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:03,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:03,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:13:03,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685195904]
[2024-02-28 21:13:03,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:03,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:03,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:03,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:03,032 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:03,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-02-28 21:13:03,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 124 transitions, 302 flow. Second operand  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:03,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:03,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-02-28 21:13:03,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:05,205 INFO  L124   PetriNetUnfolderBase]: 7178/24007 cut-off events.
[2024-02-28 21:13:05,205 INFO  L125   PetriNetUnfolderBase]: For 4871/5497 co-relation queries the response was YES.
[2024-02-28 21:13:05,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36328 conditions, 24007 events. 7178/24007 cut-off events. For 4871/5497 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 296766 event pairs, 4490 based on Foata normal form. 2/21271 useless extension candidates. Maximal degree in co-relation 35461. Up to 8464 conditions per place. 
[2024-02-28 21:13:05,348 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 36 selfloop transitions, 7 changer transitions 0/142 dead transitions.
[2024-02-28 21:13:05,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 454 flow
[2024-02-28 21:13:05,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:05,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:05,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions.
[2024-02-28 21:13:05,349 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9013333333333333
[2024-02-28 21:13:05,349 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 338 transitions.
[2024-02-28 21:13:05,349 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions.
[2024-02-28 21:13:05,349 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:05,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions.
[2024-02-28 21:13:05,350 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:05,351 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:05,351 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:05,351 INFO  L175             Difference]: Start difference. First operand has 132 places, 124 transitions, 302 flow. Second operand 3 states and 338 transitions.
[2024-02-28 21:13:05,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 454 flow
[2024-02-28 21:13:05,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:05,371 INFO  L231             Difference]: Finished difference. Result has 134 places, 130 transitions, 350 flow
[2024-02-28 21:13:05,371 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=134, PETRI_TRANSITIONS=130}
[2024-02-28 21:13:05,371 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places.
[2024-02-28 21:13:05,371 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 350 flow
[2024-02-28 21:13:05,372 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:05,372 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:05,372 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:05,372 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-02-28 21:13:05,372 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:05,372 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:05,372 INFO  L85        PathProgramCache]: Analyzing trace with hash 304378482, now seen corresponding path program 1 times
[2024-02-28 21:13:05,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:05,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978773494]
[2024-02-28 21:13:05,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:05,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:05,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:05,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 21:13:05,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:05,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978773494]
[2024-02-28 21:13:05,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978773494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:05,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:05,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 21:13:05,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306031756]
[2024-02-28 21:13:05,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:05,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 21:13:05,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:05,481 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 21:13:05,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 21:13:05,509 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-02-28 21:13:05,509 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 350 flow. Second operand  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:05,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:05,510 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-02-28 21:13:05,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:07,135 INFO  L124   PetriNetUnfolderBase]: 4997/18928 cut-off events.
[2024-02-28 21:13:07,135 INFO  L125   PetriNetUnfolderBase]: For 2714/2778 co-relation queries the response was YES.
[2024-02-28 21:13:07,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28944 conditions, 18928 events. 4997/18928 cut-off events. For 2714/2778 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 235009 event pairs, 2028 based on Foata normal form. 259/17058 useless extension candidates. Maximal degree in co-relation 23406. Up to 3632 conditions per place. 
[2024-02-28 21:13:07,244 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 40 selfloop transitions, 4 changer transitions 0/151 dead transitions.
[2024-02-28 21:13:07,244 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 151 transitions, 492 flow
[2024-02-28 21:13:07,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 21:13:07,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 21:13:07,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions.
[2024-02-28 21:13:07,246 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.89
[2024-02-28 21:13:07,246 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 445 transitions.
[2024-02-28 21:13:07,246 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions.
[2024-02-28 21:13:07,246 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:07,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions.
[2024-02-28 21:13:07,247 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:07,248 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:07,248 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:07,248 INFO  L175             Difference]: Start difference. First operand has 134 places, 130 transitions, 350 flow. Second operand 4 states and 445 transitions.
[2024-02-28 21:13:07,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 151 transitions, 492 flow
[2024-02-28 21:13:07,259 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 151 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:07,261 INFO  L231             Difference]: Finished difference. Result has 136 places, 131 transitions, 352 flow
[2024-02-28 21:13:07,261 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=136, PETRI_TRANSITIONS=131}
[2024-02-28 21:13:07,261 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places.
[2024-02-28 21:13:07,261 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 352 flow
[2024-02-28 21:13:07,262 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:07,262 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:07,262 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:07,262 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-02-28 21:13:07,262 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:07,262 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:07,262 INFO  L85        PathProgramCache]: Analyzing trace with hash -36338752, now seen corresponding path program 1 times
[2024-02-28 21:13:07,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:07,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379423802]
[2024-02-28 21:13:07,263 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:07,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:07,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:07,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:07,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:07,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379423802]
[2024-02-28 21:13:07,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379423802] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:13:07,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586844918]
[2024-02-28 21:13:07,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:07,321 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:07,321 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:13:07,322 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:13:07,328 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 21:13:07,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:07,423 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-02-28 21:13:07,425 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:13:07,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:07,484 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 21:13:07,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:07,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [586844918] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 21:13:07,523 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 21:13:07,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-02-28 21:13:07,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062144301]
[2024-02-28 21:13:07,523 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 21:13:07,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-02-28 21:13:07,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:07,524 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-02-28 21:13:07,524 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-02-28 21:13:07,580 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-02-28 21:13:07,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 352 flow. Second operand  has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:07,581 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:07,581 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-02-28 21:13:07,581 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:09,994 INFO  L124   PetriNetUnfolderBase]: 6986/24819 cut-off events.
[2024-02-28 21:13:09,995 INFO  L125   PetriNetUnfolderBase]: For 3247/3247 co-relation queries the response was YES.
[2024-02-28 21:13:10,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38373 conditions, 24819 events. 6986/24819 cut-off events. For 3247/3247 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 311486 event pairs, 1505 based on Foata normal form. 15/21402 useless extension candidates. Maximal degree in co-relation 17727. Up to 4886 conditions per place. 
[2024-02-28 21:13:10,285 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 58 selfloop transitions, 11 changer transitions 0/173 dead transitions.
[2024-02-28 21:13:10,286 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 173 transitions, 576 flow
[2024-02-28 21:13:10,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 21:13:10,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 21:13:10,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions.
[2024-02-28 21:13:10,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8328
[2024-02-28 21:13:10,288 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions.
[2024-02-28 21:13:10,288 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions.
[2024-02-28 21:13:10,288 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:10,289 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions.
[2024-02-28 21:13:10,290 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:10,292 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:10,292 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:10,292 INFO  L175             Difference]: Start difference. First operand has 136 places, 131 transitions, 352 flow. Second operand 10 states and 1041 transitions.
[2024-02-28 21:13:10,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 173 transitions, 576 flow
[2024-02-28 21:13:10,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 173 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:10,321 INFO  L231             Difference]: Finished difference. Result has 146 places, 137 transitions, 402 flow
[2024-02-28 21:13:10,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=146, PETRI_TRANSITIONS=137}
[2024-02-28 21:13:10,322 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 18 predicate places.
[2024-02-28 21:13:10,322 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 137 transitions, 402 flow
[2024-02-28 21:13:10,322 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 98.92307692307692) internal successors, (1286), 13 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:10,322 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:10,322 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:10,329 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-02-28 21:13:10,523 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:10,524 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:10,525 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:10,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 1069939606, now seen corresponding path program 1 times
[2024-02-28 21:13:10,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:10,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179531627]
[2024-02-28 21:13:10,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:10,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:10,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:10,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-02-28 21:13:10,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:10,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179531627]
[2024-02-28 21:13:10,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179531627] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:10,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:10,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:13:10,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292974023]
[2024-02-28 21:13:10,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:10,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:10,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:10,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:10,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:10,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-02-28 21:13:10,565 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 137 transitions, 402 flow. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:10,565 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:10,565 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-02-28 21:13:10,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:13,315 INFO  L124   PetriNetUnfolderBase]: 8531/31196 cut-off events.
[2024-02-28 21:13:13,315 INFO  L125   PetriNetUnfolderBase]: For 11473/13428 co-relation queries the response was YES.
[2024-02-28 21:13:13,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53189 conditions, 31196 events. 8531/31196 cut-off events. For 11473/13428 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 417675 event pairs, 4887 based on Foata normal form. 23/27760 useless extension candidates. Maximal degree in co-relation 16780. Up to 9853 conditions per place. 
[2024-02-28 21:13:13,529 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 38 selfloop transitions, 11 changer transitions 0/157 dead transitions.
[2024-02-28 21:13:13,530 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 579 flow
[2024-02-28 21:13:13,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:13,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:13,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions.
[2024-02-28 21:13:13,531 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8986666666666666
[2024-02-28 21:13:13,531 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 337 transitions.
[2024-02-28 21:13:13,531 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions.
[2024-02-28 21:13:13,531 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:13,531 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions.
[2024-02-28 21:13:13,532 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:13,533 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:13,533 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:13,533 INFO  L175             Difference]: Start difference. First operand has 146 places, 137 transitions, 402 flow. Second operand 3 states and 337 transitions.
[2024-02-28 21:13:13,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 579 flow
[2024-02-28 21:13:13,544 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 157 transitions, 571 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:13,545 INFO  L231             Difference]: Finished difference. Result has 148 places, 146 transitions, 490 flow
[2024-02-28 21:13:13,546 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=148, PETRI_TRANSITIONS=146}
[2024-02-28 21:13:13,546 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places.
[2024-02-28 21:13:13,546 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 490 flow
[2024-02-28 21:13:13,546 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:13,546 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:13,546 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:13,546 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-02-28 21:13:13,547 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:13,547 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:13,547 INFO  L85        PathProgramCache]: Analyzing trace with hash -1805915638, now seen corresponding path program 1 times
[2024-02-28 21:13:13,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:13,547 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653889616]
[2024-02-28 21:13:13,547 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:13,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:13,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:13,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-02-28 21:13:13,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:13,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653889616]
[2024-02-28 21:13:13,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653889616] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:13,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:13,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 21:13:13,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135832130]
[2024-02-28 21:13:13,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:13,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:13,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:13,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:13,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:13,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 125
[2024-02-28 21:13:13,593 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 490 flow. Second operand  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:13,594 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:13,594 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 125
[2024-02-28 21:13:13,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:14,098 INFO  L124   PetriNetUnfolderBase]: 472/4778 cut-off events.
[2024-02-28 21:13:14,098 INFO  L125   PetriNetUnfolderBase]: For 1516/1591 co-relation queries the response was YES.
[2024-02-28 21:13:14,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 4778 events. 472/4778 cut-off events. For 1516/1591 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 52409 event pairs, 234 based on Foata normal form. 128/4529 useless extension candidates. Maximal degree in co-relation 5367. Up to 454 conditions per place. 
[2024-02-28 21:13:14,121 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 16 selfloop transitions, 8 changer transitions 0/144 dead transitions.
[2024-02-28 21:13:14,121 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 517 flow
[2024-02-28 21:13:14,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:14,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:14,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions.
[2024-02-28 21:13:14,122 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9226666666666666
[2024-02-28 21:13:14,123 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 346 transitions.
[2024-02-28 21:13:14,123 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions.
[2024-02-28 21:13:14,123 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:14,123 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions.
[2024-02-28 21:13:14,124 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,124 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,124 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,125 INFO  L175             Difference]: Start difference. First operand has 148 places, 146 transitions, 490 flow. Second operand 3 states and 346 transitions.
[2024-02-28 21:13:14,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 517 flow
[2024-02-28 21:13:14,135 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 144 transitions, 505 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:14,136 INFO  L231             Difference]: Finished difference. Result has 148 places, 137 transitions, 426 flow
[2024-02-28 21:13:14,136 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=148, PETRI_TRANSITIONS=137}
[2024-02-28 21:13:14,137 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places.
[2024-02-28 21:13:14,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 426 flow
[2024-02-28 21:13:14,137 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,137 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:14,137 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:14,137 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-02-28 21:13:14,138 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:14,138 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:14,138 INFO  L85        PathProgramCache]: Analyzing trace with hash 582579221, now seen corresponding path program 1 times
[2024-02-28 21:13:14,138 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:14,138 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686970015]
[2024-02-28 21:13:14,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:14,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:14,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:14,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-02-28 21:13:14,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:14,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686970015]
[2024-02-28 21:13:14,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686970015] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:14,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:14,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:13:14,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632401453]
[2024-02-28 21:13:14,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:14,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:14,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:14,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:14,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:14,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-02-28 21:13:14,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 426 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:14,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-02-28 21:13:14,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:14,762 INFO  L124   PetriNetUnfolderBase]: 928/5614 cut-off events.
[2024-02-28 21:13:14,762 INFO  L125   PetriNetUnfolderBase]: For 3543/3583 co-relation queries the response was YES.
[2024-02-28 21:13:14,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10224 conditions, 5614 events. 928/5614 cut-off events. For 3543/3583 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 63319 event pairs, 707 based on Foata normal form. 2/5113 useless extension candidates. Maximal degree in co-relation 7438. Up to 1545 conditions per place. 
[2024-02-28 21:13:14,790 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/144 dead transitions.
[2024-02-28 21:13:14,790 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 530 flow
[2024-02-28 21:13:14,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:14,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:14,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions.
[2024-02-28 21:13:14,792 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.872
[2024-02-28 21:13:14,792 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 327 transitions.
[2024-02-28 21:13:14,792 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions.
[2024-02-28 21:13:14,792 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:14,792 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions.
[2024-02-28 21:13:14,793 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,793 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,794 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,794 INFO  L175             Difference]: Start difference. First operand has 148 places, 137 transitions, 426 flow. Second operand 3 states and 327 transitions.
[2024-02-28 21:13:14,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 530 flow
[2024-02-28 21:13:14,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 21:13:14,802 INFO  L231             Difference]: Finished difference. Result has 151 places, 140 transitions, 452 flow
[2024-02-28 21:13:14,802 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=151, PETRI_TRANSITIONS=140}
[2024-02-28 21:13:14,802 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 23 predicate places.
[2024-02-28 21:13:14,803 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 140 transitions, 452 flow
[2024-02-28 21:13:14,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:14,803 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:14,803 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:14,803 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-02-28 21:13:14,804 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:14,804 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:14,804 INFO  L85        PathProgramCache]: Analyzing trace with hash -1061457761, now seen corresponding path program 1 times
[2024-02-28 21:13:14,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:14,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025041386]
[2024-02-28 21:13:14,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:14,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:14,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:14,909 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:14,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:14,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025041386]
[2024-02-28 21:13:14,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025041386] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:13:14,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509736169]
[2024-02-28 21:13:14,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:14,910 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:14,910 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:13:14,911 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:13:14,916 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 21:13:14,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:14,997 INFO  L262         TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core
[2024-02-28 21:13:15,000 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:13:15,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:15,153 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 21:13:15,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:15,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [509736169] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 21:13:15,237 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 21:13:15,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19
[2024-02-28 21:13:15,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764837037]
[2024-02-28 21:13:15,238 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 21:13:15,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-02-28 21:13:15,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:15,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-02-28 21:13:15,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342
[2024-02-28 21:13:15,311 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-02-28 21:13:15,313 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 140 transitions, 452 flow. Second operand  has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:15,313 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:15,313 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-02-28 21:13:15,313 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:16,352 INFO  L124   PetriNetUnfolderBase]: 1216/7900 cut-off events.
[2024-02-28 21:13:16,352 INFO  L125   PetriNetUnfolderBase]: For 3282/3529 co-relation queries the response was YES.
[2024-02-28 21:13:16,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13529 conditions, 7900 events. 1216/7900 cut-off events. For 3282/3529 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 85618 event pairs, 179 based on Foata normal form. 20/7197 useless extension candidates. Maximal degree in co-relation 5310. Up to 893 conditions per place. 
[2024-02-28 21:13:16,398 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 84 selfloop transitions, 14 changer transitions 1/206 dead transitions.
[2024-02-28 21:13:16,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 206 transitions, 858 flow
[2024-02-28 21:13:16,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-02-28 21:13:16,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-02-28 21:13:16,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1458 transitions.
[2024-02-28 21:13:16,401 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8331428571428572
[2024-02-28 21:13:16,401 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1458 transitions.
[2024-02-28 21:13:16,402 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1458 transitions.
[2024-02-28 21:13:16,402 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:16,402 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1458 transitions.
[2024-02-28 21:13:16,405 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 104.14285714285714) internal successors, (1458), 14 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:16,406 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:16,407 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:16,407 INFO  L175             Difference]: Start difference. First operand has 151 places, 140 transitions, 452 flow. Second operand 14 states and 1458 transitions.
[2024-02-28 21:13:16,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 206 transitions, 858 flow
[2024-02-28 21:13:16,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 206 transitions, 846 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:16,416 INFO  L231             Difference]: Finished difference. Result has 166 places, 144 transitions, 507 flow
[2024-02-28 21:13:16,416 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=507, PETRI_PLACES=166, PETRI_TRANSITIONS=144}
[2024-02-28 21:13:16,417 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 38 predicate places.
[2024-02-28 21:13:16,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 144 transitions, 507 flow
[2024-02-28 21:13:16,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:16,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:16,418 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:16,424 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-02-28 21:13:16,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-02-28 21:13:16,619 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:16,620 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:16,620 INFO  L85        PathProgramCache]: Analyzing trace with hash 665008963, now seen corresponding path program 1 times
[2024-02-28 21:13:16,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:16,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413844807]
[2024-02-28 21:13:16,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:16,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:16,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:16,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2024-02-28 21:13:16,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:16,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413844807]
[2024-02-28 21:13:16,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413844807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:16,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:16,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:13:16,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599392132]
[2024-02-28 21:13:16,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:16,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:16,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:16,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:16,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:16,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-02-28 21:13:16,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 144 transitions, 507 flow. Second operand  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:16,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:16,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-02-28 21:13:16,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:17,310 INFO  L124   PetriNetUnfolderBase]: 883/5676 cut-off events.
[2024-02-28 21:13:17,310 INFO  L125   PetriNetUnfolderBase]: For 4246/4270 co-relation queries the response was YES.
[2024-02-28 21:13:17,329 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10741 conditions, 5676 events. 883/5676 cut-off events. For 4246/4270 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62301 event pairs, 677 based on Foata normal form. 1/5182 useless extension candidates. Maximal degree in co-relation 9955. Up to 1476 conditions per place. 
[2024-02-28 21:13:17,342 INFO  L140   encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/150 dead transitions.
[2024-02-28 21:13:17,342 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 150 transitions, 602 flow
[2024-02-28 21:13:17,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:17,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:17,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions.
[2024-02-28 21:13:17,343 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8693333333333333
[2024-02-28 21:13:17,343 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 326 transitions.
[2024-02-28 21:13:17,343 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions.
[2024-02-28 21:13:17,343 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:17,343 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions.
[2024-02-28 21:13:17,344 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:17,344 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:17,345 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:17,345 INFO  L175             Difference]: Start difference. First operand has 166 places, 144 transitions, 507 flow. Second operand 3 states and 326 transitions.
[2024-02-28 21:13:17,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 150 transitions, 602 flow
[2024-02-28 21:13:17,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 150 transitions, 584 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-02-28 21:13:17,366 INFO  L231             Difference]: Finished difference. Result has 163 places, 147 transitions, 525 flow
[2024-02-28 21:13:17,367 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=163, PETRI_TRANSITIONS=147}
[2024-02-28 21:13:17,367 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 35 predicate places.
[2024-02-28 21:13:17,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 147 transitions, 525 flow
[2024-02-28 21:13:17,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:17,367 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:17,367 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:17,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-02-28 21:13:17,368 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:17,368 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:17,368 INFO  L85        PathProgramCache]: Analyzing trace with hash -691052328, now seen corresponding path program 1 times
[2024-02-28 21:13:17,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:17,368 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95278148]
[2024-02-28 21:13:17,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:17,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:17,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:17,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 52 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:17,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:17,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95278148]
[2024-02-28 21:13:17,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95278148] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:13:17,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868275664]
[2024-02-28 21:13:17,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:17,508 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:17,508 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:13:17,508 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:13:17,510 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 21:13:17,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:17,598 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core
[2024-02-28 21:13:17,600 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:13:17,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:13:17,843 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 21:13:17,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868275664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:17,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 21:13:17,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21
[2024-02-28 21:13:17,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819194087]
[2024-02-28 21:13:17,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:17,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-02-28 21:13:17,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:17,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-02-28 21:13:17,844 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420
[2024-02-28 21:13:17,895 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 125
[2024-02-28 21:13:17,896 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 147 transitions, 525 flow. Second operand  has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:17,896 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:17,896 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 125
[2024-02-28 21:13:17,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:18,966 INFO  L124   PetriNetUnfolderBase]: 1122/7422 cut-off events.
[2024-02-28 21:13:18,966 INFO  L125   PetriNetUnfolderBase]: For 4674/4959 co-relation queries the response was YES.
[2024-02-28 21:13:18,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 7422 events. 1122/7422 cut-off events. For 4674/4959 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 80738 event pairs, 172 based on Foata normal form. 48/6797 useless extension candidates. Maximal degree in co-relation 5711. Up to 572 conditions per place. 
[2024-02-28 21:13:19,007 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 89 selfloop transitions, 16 changer transitions 8/223 dead transitions.
[2024-02-28 21:13:19,007 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 223 transitions, 972 flow
[2024-02-28 21:13:19,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-02-28 21:13:19,008 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-02-28 21:13:19,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1682 transitions.
[2024-02-28 21:13:19,009 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.841
[2024-02-28 21:13:19,009 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1682 transitions.
[2024-02-28 21:13:19,009 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1682 transitions.
[2024-02-28 21:13:19,010 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:19,010 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1682 transitions.
[2024-02-28 21:13:19,012 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 105.125) internal successors, (1682), 16 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:19,014 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:19,014 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 125.0) internal successors, (2125), 17 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:19,014 INFO  L175             Difference]: Start difference. First operand has 163 places, 147 transitions, 525 flow. Second operand 16 states and 1682 transitions.
[2024-02-28 21:13:19,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 223 transitions, 972 flow
[2024-02-28 21:13:19,026 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 223 transitions, 950 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-02-28 21:13:19,028 INFO  L231             Difference]: Finished difference. Result has 171 places, 145 transitions, 520 flow
[2024-02-28 21:13:19,028 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=520, PETRI_PLACES=171, PETRI_TRANSITIONS=145}
[2024-02-28 21:13:19,028 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 43 predicate places.
[2024-02-28 21:13:19,029 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 145 transitions, 520 flow
[2024-02-28 21:13:19,029 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:19,029 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:19,029 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:19,035 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 21:13:19,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:19,231 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:19,232 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:19,232 INFO  L85        PathProgramCache]: Analyzing trace with hash -455501539, now seen corresponding path program 1 times
[2024-02-28 21:13:19,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:19,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744899785]
[2024-02-28 21:13:19,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:19,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:19,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:19,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-02-28 21:13:19,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:19,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744899785]
[2024-02-28 21:13:19,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744899785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:19,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:19,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 21:13:19,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386797395]
[2024-02-28 21:13:19,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:19,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 21:13:19,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:19,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 21:13:19,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 21:13:19,622 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125
[2024-02-28 21:13:19,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 145 transitions, 520 flow. Second operand  has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:19,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:19,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125
[2024-02-28 21:13:19,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:20,477 INFO  L124   PetriNetUnfolderBase]: 2334/8603 cut-off events.
[2024-02-28 21:13:20,477 INFO  L125   PetriNetUnfolderBase]: For 3825/4053 co-relation queries the response was YES.
[2024-02-28 21:13:20,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17385 conditions, 8603 events. 2334/8603 cut-off events. For 3825/4053 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 91411 event pairs, 950 based on Foata normal form. 0/7884 useless extension candidates. Maximal degree in co-relation 16744. Up to 1797 conditions per place. 
[2024-02-28 21:13:20,522 INFO  L140   encePairwiseOnDemand]: 119/125 looper letters, 55 selfloop transitions, 6 changer transitions 0/176 dead transitions.
[2024-02-28 21:13:20,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 176 transitions, 736 flow
[2024-02-28 21:13:20,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 21:13:20,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 21:13:20,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions.
[2024-02-28 21:13:20,523 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2024-02-28 21:13:20,523 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 625 transitions.
[2024-02-28 21:13:20,523 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions.
[2024-02-28 21:13:20,524 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:20,524 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions.
[2024-02-28 21:13:20,524 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:20,525 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:20,526 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:20,526 INFO  L175             Difference]: Start difference. First operand has 171 places, 145 transitions, 520 flow. Second operand 6 states and 625 transitions.
[2024-02-28 21:13:20,526 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 176 transitions, 736 flow
[2024-02-28 21:13:20,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 176 transitions, 682 flow, removed 3 selfloop flow, removed 17 redundant places.
[2024-02-28 21:13:20,563 INFO  L231             Difference]: Finished difference. Result has 158 places, 144 transitions, 476 flow
[2024-02-28 21:13:20,564 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=158, PETRI_TRANSITIONS=144}
[2024-02-28 21:13:20,564 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 30 predicate places.
[2024-02-28 21:13:20,564 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 144 transitions, 476 flow
[2024-02-28 21:13:20,564 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:20,564 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:20,564 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:20,564 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-02-28 21:13:20,565 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:20,565 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:20,565 INFO  L85        PathProgramCache]: Analyzing trace with hash -377896736, now seen corresponding path program 1 times
[2024-02-28 21:13:20,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:20,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058985929]
[2024-02-28 21:13:20,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:20,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:20,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:20,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2024-02-28 21:13:20,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:20,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058985929]
[2024-02-28 21:13:20,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058985929] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:13:20,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:13:20,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:13:20,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600947111]
[2024-02-28 21:13:20,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:13:20,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:13:20,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:20,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:13:20,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:13:20,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125
[2024-02-28 21:13:20,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 144 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:20,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:20,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125
[2024-02-28 21:13:20,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:21,385 INFO  L124   PetriNetUnfolderBase]: 1353/8906 cut-off events.
[2024-02-28 21:13:21,385 INFO  L125   PetriNetUnfolderBase]: For 5209/5230 co-relation queries the response was YES.
[2024-02-28 21:13:21,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16947 conditions, 8906 events. 1353/8906 cut-off events. For 5209/5230 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106620 event pairs, 605 based on Foata normal form. 0/8360 useless extension candidates. Maximal degree in co-relation 16203. Up to 1591 conditions per place. 
[2024-02-28 21:13:21,421 INFO  L140   encePairwiseOnDemand]: 118/125 looper letters, 30 selfloop transitions, 9 changer transitions 1/157 dead transitions.
[2024-02-28 21:13:21,421 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 157 transitions, 610 flow
[2024-02-28 21:13:21,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:13:21,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:13:21,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions.
[2024-02-28 21:13:21,422 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8986666666666666
[2024-02-28 21:13:21,422 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 337 transitions.
[2024-02-28 21:13:21,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions.
[2024-02-28 21:13:21,423 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:21,423 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions.
[2024-02-28 21:13:21,423 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:21,424 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:21,424 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:21,424 INFO  L175             Difference]: Start difference. First operand has 158 places, 144 transitions, 476 flow. Second operand 3 states and 337 transitions.
[2024-02-28 21:13:21,424 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 157 transitions, 610 flow
[2024-02-28 21:13:21,482 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 157 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-02-28 21:13:21,483 INFO  L231             Difference]: Finished difference. Result has 157 places, 148 transitions, 540 flow
[2024-02-28 21:13:21,483 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=157, PETRI_TRANSITIONS=148}
[2024-02-28 21:13:21,484 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 29 predicate places.
[2024-02-28 21:13:21,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 540 flow
[2024-02-28 21:13:21,484 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:21,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:21,484 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:21,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-02-28 21:13:21,485 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:21,485 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:21,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -2123264483, now seen corresponding path program 1 times
[2024-02-28 21:13:21,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:21,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983969707]
[2024-02-28 21:13:21,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:21,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:21,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:21,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-02-28 21:13:21,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:13:21,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983969707]
[2024-02-28 21:13:21,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983969707] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:13:21,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797374243]
[2024-02-28 21:13:21,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:21,571 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:21,571 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:13:21,572 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:13:21,576 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 21:13:21,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:13:21,666 INFO  L262         TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-02-28 21:13:21,671 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:13:21,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-02-28 21:13:21,829 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 21:13:21,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-02-28 21:13:21,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797374243] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 21:13:21,927 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 21:13:21,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12
[2024-02-28 21:13:21,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137543983]
[2024-02-28 21:13:21,928 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 21:13:21,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-02-28 21:13:21,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:13:21,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-02-28 21:13:21,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2024-02-28 21:13:22,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125
[2024-02-28 21:13:22,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 148 transitions, 540 flow. Second operand  has 12 states, 12 states have (on average 100.33333333333333) internal successors, (1204), 12 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:22,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:13:22,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125
[2024-02-28 21:13:22,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:13:22,605 INFO  L124   PetriNetUnfolderBase]: 1050/4095 cut-off events.
[2024-02-28 21:13:22,605 INFO  L125   PetriNetUnfolderBase]: For 1793/1821 co-relation queries the response was YES.
[2024-02-28 21:13:22,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7677 conditions, 4095 events. 1050/4095 cut-off events. For 1793/1821 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 35282 event pairs, 84 based on Foata normal form. 128/4169 useless extension candidates. Maximal degree in co-relation 7031. Up to 518 conditions per place. 
[2024-02-28 21:13:22,625 INFO  L140   encePairwiseOnDemand]: 117/125 looper letters, 88 selfloop transitions, 10 changer transitions 17/228 dead transitions.
[2024-02-28 21:13:22,625 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 228 transitions, 1000 flow
[2024-02-28 21:13:22,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 21:13:22,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 21:13:22,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1079 transitions.
[2024-02-28 21:13:22,627 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8632
[2024-02-28 21:13:22,627 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1079 transitions.
[2024-02-28 21:13:22,627 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1079 transitions.
[2024-02-28 21:13:22,628 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:13:22,628 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1079 transitions.
[2024-02-28 21:13:22,629 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 107.9) internal successors, (1079), 10 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:22,630 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:22,630 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:22,630 INFO  L175             Difference]: Start difference. First operand has 157 places, 148 transitions, 540 flow. Second operand 10 states and 1079 transitions.
[2024-02-28 21:13:22,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 228 transitions, 1000 flow
[2024-02-28 21:13:22,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 228 transitions, 982 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:13:22,636 INFO  L231             Difference]: Finished difference. Result has 167 places, 145 transitions, 540 flow
[2024-02-28 21:13:22,636 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=540, PETRI_PLACES=167, PETRI_TRANSITIONS=145}
[2024-02-28 21:13:22,637 INFO  L281   CegarLoopForPetriNet]: 128 programPoint places, 39 predicate places.
[2024-02-28 21:13:22,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 540 flow
[2024-02-28 21:13:22,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 100.33333333333333) internal successors, (1204), 12 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:13:22,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:13:22,637 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:22,644 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 21:13:22,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:13:22,838 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-02-28 21:13:22,839 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:13:22,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 186415000, now seen corresponding path program 1 times
[2024-02-28 21:13:22,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:13:22,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623706516]
[2024-02-28 21:13:22,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:13:22,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:13:22,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:13:22,872 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:13:22,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:13:22,909 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:13:22,909 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-02-28 21:13:22,910 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-02-28 21:13:22,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-02-28 21:13:22,910 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:13:22,914 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2024-02-28 21:13:22,914 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-02-28 21:13:22,981 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:22,982 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:22,982 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:22,983 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:22,983 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:22,983 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:22,983 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,983 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:22,984 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:22,984 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,984 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:22,984 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:22,984 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,984 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,985 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,986 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,987 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,987 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:22,987 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,987 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-02-28 21:13:22,987 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,987 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,988 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,988 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,988 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,988 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,988 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,988 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,989 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,989 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,989 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,989 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,989 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,989 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,990 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:22,990 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,990 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,990 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:22,990 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:13:22,990 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:22,991 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:22,991 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:22,991 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:22,991 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:22,991 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,000 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 09:13:23 BasicIcfg
[2024-02-28 21:13:23,000 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-02-28 21:13:23,001 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-02-28 21:13:23,001 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-02-28 21:13:23,001 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-02-28 21:13:23,001 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:12:56" (3/4) ...
[2024-02-28 21:13:23,002 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-02-28 21:13:23,003 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-02-28 21:13:23,003 INFO  L158              Benchmark]: Toolchain (without parser) took 26987.07ms. Allocated memory was 109.1MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 72.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
[2024-02-28 21:13:23,004 INFO  L158              Benchmark]: CDTParser took 0.36ms. Allocated memory is still 109.1MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 21:13:23,004 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 303.97ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 52.9MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-02-28 21:13:23,004 INFO  L158              Benchmark]: Boogie Procedure Inliner took 30.61ms. Allocated memory is still 109.1MB. Free memory was 52.9MB in the beginning and 51.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 21:13:23,004 INFO  L158              Benchmark]: Boogie Preprocessor took 20.10ms. Allocated memory is still 109.1MB. Free memory was 51.3MB in the beginning and 49.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 21:13:23,004 INFO  L158              Benchmark]: RCFGBuilder took 310.65ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 49.6MB in the beginning and 103.5MB in the end (delta: -53.9MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB.
[2024-02-28 21:13:23,005 INFO  L158              Benchmark]: TraceAbstraction took 26313.83ms. Allocated memory was 136.3MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 102.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
[2024-02-28 21:13:23,005 INFO  L158              Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 4.4GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 21:13:23,006 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.36ms. Allocated memory is still 109.1MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 303.97ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 52.9MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 30.61ms. Allocated memory is still 109.1MB. Free memory was 52.9MB in the beginning and 51.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 20.10ms. Allocated memory is still 109.1MB. Free memory was 51.3MB in the beginning and 49.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 310.65ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 49.6MB in the beginning and 103.5MB in the end (delta: -53.9MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 26313.83ms. Allocated memory was 136.3MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 102.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
 * Witness Printer took 2.61ms. Allocated memory is still 4.4GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 678]: Data race detected
[2024-02-28 21:13:23,046 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,046 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,047 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,047 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,047 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,047 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,047 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,047 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,047 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,048 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,049 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,050 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,051 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,052 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,053 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,053 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,091 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,091 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,092 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,093 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post7 could not be translated
[2024-02-28 21:13:23,094 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,095 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet0 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,096 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,097 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,097 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:13:23,097 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:13:23,097 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
        VAL             [data=0]
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [data=0, data_mutex={1:0}]
[L683]               0  int threads_total = 4;
        VAL             [data=0, data_mutex={1:0}, threads_total=4]
[L684]               0  pthread_t tids[4];
        VAL             [data=0, data_mutex={1:0}, threads_total=4, tids={13:0}]
[L685]               0  int i = 0;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L685]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L685]  COND TRUE    0  i < threads_total
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L678]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               3  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L680]               3  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={13:0}]
[L685]  COND FALSE   0  !(i < threads_total)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={13:0}]
[L688]               0  int i = 0;
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L688]  COND TRUE    0  i < threads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L680]               1  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L680]               2  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L688]  COND TRUE    0  i < threads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L689]  FCALL, JOIN  2  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L688]  COND TRUE    0  i < threads_total - 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L688]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L688]  COND FALSE   0  !(i < threads_total - 1)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L691]               0  return data;
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={13:0}]
[L678]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]

Now there is a data race on ~data~0 between 
	C: return data; [691]
and
	C: data = __VERIFIER_nondet_int() [678]

  - UnprovableResult [Line: 691]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 689]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 686]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 86 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 14 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 103 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 30 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 120 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 22 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 31/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
    CFG has 6 procedures, 137 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.7s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1273 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1049 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 113 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 410 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=12, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1092 ConstructedInterpolants, 0 QuantifiedInterpolants, 3095 SizeOfPredicates, 26 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 529/662 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-02-28 21:13:23,109 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
