./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB --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 dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:28:59,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:28:59,583 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:28:59,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:28:59,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:28:59,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:28:59,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:28:59,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:28:59,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:28:59,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:28:59,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:28:59,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:28:59,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:28:59,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:28:59,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:28:59,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:28:59,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:28:59,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:28:59,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:28:59,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:28:59,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:28:59,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:59,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:28:59,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:28:59,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:28:59,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:59,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:28:59,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB 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 -> dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec [2024-11-28 03:28:59,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:28:59,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:28:59,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:28:59,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:28:59,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:28:59,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2024-11-28 03:29:03,070 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/data/5afe99c70/68e226575b8e4d488ff56591f93d79b5/FLAGd687b9da6 [2024-11-28 03:29:03,478 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:03,478 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2024-11-28 03:29:03,497 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/data/5afe99c70/68e226575b8e4d488ff56591f93d79b5/FLAGd687b9da6 [2024-11-28 03:29:03,513 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/data/5afe99c70/68e226575b8e4d488ff56591f93d79b5 [2024-11-28 03:29:03,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:03,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:03,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:03,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:03,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:03,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:03" (1/1) ... [2024-11-28 03:29:03,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1125ba59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:03, skipping insertion in model container [2024-11-28 03:29:03,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:03" (1/1) ... [2024-11-28 03:29:03,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:04,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:04,136 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:29:04,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:04,288 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:29:04,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04 WrapperNode [2024-11-28 03:29:04,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:04,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:04,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:29:04,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:29:04,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,339 INFO L138 Inliner]: procedures = 273, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-28 03:29:04,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:04,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:29:04,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:29:04,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:29:04,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:29:04,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:29:04,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:29:04,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:29:04,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (1/1) ... [2024-11-28 03:29:04,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:04,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:04,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:29:04,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:29:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:29:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:29:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:29:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:29:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-28 03:29:04,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-28 03:29:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:29:04,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:29:04,497 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:29:04,668 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:29:04,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:29:05,036 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:29:05,036 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:29:05,054 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:29:05,054 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:29:05,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:05 BoogieIcfgContainer [2024-11-28 03:29:05,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:29:05,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:29:05,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:29:05,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:29:05,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:29:03" (1/3) ... [2024-11-28 03:29:05,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5fa25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:05, skipping insertion in model container [2024-11-28 03:29:05,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:04" (2/3) ... [2024-11-28 03:29:05,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5fa25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:05, skipping insertion in model container [2024-11-28 03:29:05,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:05" (3/3) ... [2024-11-28 03:29:05,071 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race.i [2024-11-28 03:29:05,089 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:29:05,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-inc-race.i that has 2 procedures, 108 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2024-11-28 03:29:05,093 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:29:05,227 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-28 03:29:05,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 112 transitions, 231 flow [2024-11-28 03:29:05,389 INFO L124 PetriNetUnfolderBase]: 6/147 cut-off events. [2024-11-28 03:29:05,391 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:29:05,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 147 events. 6/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 251 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2024-11-28 03:29:05,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 112 transitions, 231 flow [2024-11-28 03:29:05,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 112 transitions, 231 flow [2024-11-28 03:29:05,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:29:05,423 INFO L333 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, 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;@602b21bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:29:05,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-28 03:29:05,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:29:05,437 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-11-28 03:29:05,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:29:05,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:05,439 INFO L206 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] [2024-11-28 03:29:05,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:05,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1039872137, now seen corresponding path program 1 times [2024-11-28 03:29:05,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:05,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182742169] [2024-11-28 03:29:05,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:05,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182742169] [2024-11-28 03:29:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182742169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:05,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940207145] [2024-11-28 03:29:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:05,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:05,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:05,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:05,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:05,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2024-11-28 03:29:05,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11-28 03:29:05,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:05,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2024-11-28 03:29:05,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:05,978 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2024-11-28 03:29:05,978 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-28 03:29:05,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 151 events. 3/151 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 297 event pairs, 2 based on Foata normal form. 7/140 useless extension candidates. Maximal degree in co-relation 90. Up to 15 conditions per place. [2024-11-28 03:29:05,986 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 8 selfloop transitions, 2 changer transitions 1/108 dead transitions. [2024-11-28 03:29:05,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 243 flow [2024-11-28 03:29:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2024-11-28 03:29:06,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-11-28 03:29:06,009 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 231 flow. Second operand 3 states and 308 transitions. [2024-11-28 03:29:06,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 243 flow [2024-11-28 03:29:06,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:06,026 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 225 flow [2024-11-28 03:29:06,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2024-11-28 03:29:06,036 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2024-11-28 03:29:06,036 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 225 flow [2024-11-28 03:29:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11-28 03:29:06,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:06,038 INFO L206 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-11-28 03:29:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:29:06,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1805376101, now seen corresponding path program 1 times [2024-11-28 03:29:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083066273] [2024-11-28 03:29:06,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083066273] [2024-11-28 03:29:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083066273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:06,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:06,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187491926] [2024-11-28 03:29:06,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:06,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:06,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:06,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:06,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-11-28 03:29:06,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11-28 03:29:06,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:06,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-11-28 03:29:06,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:06,264 INFO L124 PetriNetUnfolderBase]: 5/190 cut-off events. [2024-11-28 03:29:06,268 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-28 03:29:06,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 190 events. 5/190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 401 event pairs, 2 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 184. Up to 16 conditions per place. [2024-11-28 03:29:06,270 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-11-28 03:29:06,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 243 flow [2024-11-28 03:29:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2024-11-28 03:29:06,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2024-11-28 03:29:06,277 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 225 flow. Second operand 3 states and 311 transitions. [2024-11-28 03:29:06,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 243 flow [2024-11-28 03:29:06,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:06,285 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 231 flow [2024-11-28 03:29:06,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2024-11-28 03:29:06,288 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -1 predicate places. [2024-11-28 03:29:06,289 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 231 flow [2024-11-28 03:29:06,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11-28 03:29:06,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:06,290 INFO L206 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, 1, 1] [2024-11-28 03:29:06,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:29:06,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:06,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1449122225, now seen corresponding path program 1 times [2024-11-28 03:29:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:06,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943972630] [2024-11-28 03:29:06,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:06,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943972630] [2024-11-28 03:29:06,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943972630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20465202] [2024-11-28 03:29:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:06,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:29:06,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:06,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:29:06,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:29:06,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 112 [2024-11-28 03:29:06,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-11-28 03:29:06,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:06,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 112 [2024-11-28 03:29:06,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:06,974 INFO L124 PetriNetUnfolderBase]: 2/163 cut-off events. [2024-11-28 03:29:06,974 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2024-11-28 03:29:06,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 163 events. 2/163 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 243 event pairs, 0 based on Foata normal form. 2/156 useless extension candidates. Maximal degree in co-relation 101. Up to 16 conditions per place. [2024-11-28 03:29:06,977 INFO L140 encePairwiseOnDemand]: 104/112 looper letters, 11 selfloop transitions, 2 changer transitions 5/112 dead transitions. [2024-11-28 03:29:06,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 277 flow [2024-11-28 03:29:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:29:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2024-11-28 03:29:06,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8854166666666666 [2024-11-28 03:29:06,986 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 231 flow. Second operand 6 states and 595 transitions. [2024-11-28 03:29:06,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 277 flow [2024-11-28 03:29:06,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:06,993 INFO L231 Difference]: Finished difference. Result has 119 places, 107 transitions, 249 flow [2024-11-28 03:29:06,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=119, PETRI_TRANSITIONS=107} [2024-11-28 03:29:06,994 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2024-11-28 03:29:06,994 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 107 transitions, 249 flow [2024-11-28 03:29:06,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-11-28 03:29:06,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:06,995 INFO L206 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, 1, 1] [2024-11-28 03:29:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:29:06,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash 899985057, now seen corresponding path program 1 times [2024-11-28 03:29:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101932425] [2024-11-28 03:29:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101932425] [2024-11-28 03:29:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101932425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:07,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939563443] [2024-11-28 03:29:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:07,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:07,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:07,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:07,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2024-11-28 03:29:07,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 107 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-11-28 03:29:07,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:07,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2024-11-28 03:29:07,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:08,275 INFO L124 PetriNetUnfolderBase]: 72/403 cut-off events. [2024-11-28 03:29:08,275 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-28 03:29:08,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 403 events. 72/403 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1889 event pairs, 32 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 544. Up to 154 conditions per place. [2024-11-28 03:29:08,282 INFO L140 encePairwiseOnDemand]: 101/112 looper letters, 23 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2024-11-28 03:29:08,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 128 transitions, 381 flow [2024-11-28 03:29:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:29:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2024-11-28 03:29:08,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8273809523809523 [2024-11-28 03:29:08,285 INFO L175 Difference]: Start difference. First operand has 119 places, 107 transitions, 249 flow. Second operand 6 states and 556 transitions. [2024-11-28 03:29:08,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 128 transitions, 381 flow [2024-11-28 03:29:08,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 128 transitions, 367 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-28 03:29:08,293 INFO L231 Difference]: Finished difference. Result has 121 places, 128 transitions, 385 flow [2024-11-28 03:29:08,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=121, PETRI_TRANSITIONS=128} [2024-11-28 03:29:08,294 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2024-11-28 03:29:08,294 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 128 transitions, 385 flow [2024-11-28 03:29:08,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-11-28 03:29:08,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:08,295 INFO L206 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:08,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:29:08,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:08,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:08,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1066105671, now seen corresponding path program 1 times [2024-11-28 03:29:08,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:08,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088978393] [2024-11-28 03:29:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:08,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088978393] [2024-11-28 03:29:08,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088978393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:08,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:08,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666646599] [2024-11-28 03:29:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:08,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:08,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:08,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:08,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:08,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-11-28 03:29:08,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 128 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11-28 03:29:08,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:08,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-11-28 03:29:08,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:08,466 INFO L124 PetriNetUnfolderBase]: 30/264 cut-off events. [2024-11-28 03:29:08,466 INFO L125 PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES. [2024-11-28 03:29:08,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 264 events. 30/264 cut-off events. For 29/38 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 888 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 348. Up to 49 conditions per place. [2024-11-28 03:29:08,471 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 5 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-11-28 03:29:08,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 126 transitions, 395 flow [2024-11-28 03:29:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-28 03:29:08,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2024-11-28 03:29:08,473 INFO L175 Difference]: Start difference. First operand has 121 places, 128 transitions, 385 flow. Second operand 3 states and 309 transitions. [2024-11-28 03:29:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 126 transitions, 395 flow [2024-11-28 03:29:08,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:08,483 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 385 flow [2024-11-28 03:29:08,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2024-11-28 03:29:08,485 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2024-11-28 03:29:08,485 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 385 flow [2024-11-28 03:29:08,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11-28 03:29:08,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:08,486 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:08,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:29:08,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:08,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1144842082, now seen corresponding path program 1 times [2024-11-28 03:29:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:08,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937771803] [2024-11-28 03:29:08,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:08,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:08,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:08,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937771803] [2024-11-28 03:29:08,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937771803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:08,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:08,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762237885] [2024-11-28 03:29:08,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:08,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:08,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:08,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:08,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-11-28 03:29:08,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-11-28 03:29:08,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:08,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-11-28 03:29:08,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:08,693 INFO L124 PetriNetUnfolderBase]: 30/263 cut-off events. [2024-11-28 03:29:08,693 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2024-11-28 03:29:08,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 263 events. 30/263 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 882 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 364. Up to 49 conditions per place. [2024-11-28 03:29:08,695 INFO L140 encePairwiseOnDemand]: 109/112 looper letters, 6 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-11-28 03:29:08,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 399 flow [2024-11-28 03:29:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-28 03:29:08,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2024-11-28 03:29:08,698 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 385 flow. Second operand 3 states and 309 transitions. [2024-11-28 03:29:08,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 399 flow [2024-11-28 03:29:08,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:08,708 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 383 flow [2024-11-28 03:29:08,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2024-11-28 03:29:08,709 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2024-11-28 03:29:08,709 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 383 flow [2024-11-28 03:29:08,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-11-28 03:29:08,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:08,712 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:08,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:29:08,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:08,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1829849719, now seen corresponding path program 1 times [2024-11-28 03:29:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:08,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660037315] [2024-11-28 03:29:08,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660037315] [2024-11-28 03:29:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660037315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537658126] [2024-11-28 03:29:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:09,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:09,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:09,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2024-11-28 03:29:09,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 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-11-28 03:29:09,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:09,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2024-11-28 03:29:09,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:09,719 INFO L124 PetriNetUnfolderBase]: 81/424 cut-off events. [2024-11-28 03:29:09,720 INFO L125 PetriNetUnfolderBase]: For 104/252 co-relation queries the response was YES. [2024-11-28 03:29:09,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 424 events. 81/424 cut-off events. For 104/252 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2074 event pairs, 15 based on Foata normal form. 16/410 useless extension candidates. Maximal degree in co-relation 774. Up to 173 conditions per place. [2024-11-28 03:29:09,724 INFO L140 encePairwiseOnDemand]: 101/112 looper letters, 38 selfloop transitions, 21 changer transitions 7/147 dead transitions. [2024-11-28 03:29:09,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 588 flow [2024-11-28 03:29:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:29:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2024-11-28 03:29:09,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-11-28 03:29:09,731 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 383 flow. Second operand 6 states and 567 transitions. [2024-11-28 03:29:09,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 588 flow [2024-11-28 03:29:09,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 147 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:09,757 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 540 flow [2024-11-28 03:29:09,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2024-11-28 03:29:09,761 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2024-11-28 03:29:09,761 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 540 flow [2024-11-28 03:29:09,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 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-11-28 03:29:09,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:09,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:09,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:29:09,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-28 03:29:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1047383728, now seen corresponding path program 1 times [2024-11-28 03:29:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917021668] [2024-11-28 03:29:09,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:29:09,806 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:29:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:29:09,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:29:09,869 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:29:09,871 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-28 03:29:09,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-28 03:29:09,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-28 03:29:09,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-28 03:29:09,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-28 03:29:09,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-28 03:29:09,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-28 03:29:09,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:29:09,874 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:09,879 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:29:09,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-28 03:29:09,919 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 03:29:09,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 148 transitions, 312 flow [2024-11-28 03:29:10,000 INFO L124 PetriNetUnfolderBase]: 11/254 cut-off events. [2024-11-28 03:29:10,001 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-28 03:29:10,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 254 events. 11/254 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 585 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2024-11-28 03:29:10,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 148 transitions, 312 flow [2024-11-28 03:29:10,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 148 transitions, 312 flow [2024-11-28 03:29:10,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:29:10,009 INFO L333 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, 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;@602b21bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:29:10,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-28 03:29:10,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:29:10,013 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-11-28 03:29:10,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:29:10,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:10,014 INFO L206 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] [2024-11-28 03:29:10,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:10,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash -331428215, now seen corresponding path program 1 times [2024-11-28 03:29:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531493948] [2024-11-28 03:29:10,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531493948] [2024-11-28 03:29:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531493948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925252717] [2024-11-28 03:29:10,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:10,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:10,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:10,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:10,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-28 03:29:10,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-11-28 03:29:10,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:10,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-28 03:29:10,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:10,205 INFO L124 PetriNetUnfolderBase]: 19/420 cut-off events. [2024-11-28 03:29:10,205 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2024-11-28 03:29:10,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 420 events. 19/420 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1714 event pairs, 16 based on Foata normal form. 17/386 useless extension candidates. Maximal degree in co-relation 291. Up to 50 conditions per place. [2024-11-28 03:29:10,211 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 11 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2024-11-28 03:29:10,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 330 flow [2024-11-28 03:29:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-11-28 03:29:10,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9234234234234234 [2024-11-28 03:29:10,213 INFO L175 Difference]: Start difference. First operand has 148 places, 148 transitions, 312 flow. Second operand 3 states and 410 transitions. [2024-11-28 03:29:10,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 330 flow [2024-11-28 03:29:10,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:10,216 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 306 flow [2024-11-28 03:29:10,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2024-11-28 03:29:10,218 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2024-11-28 03:29:10,219 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 306 flow [2024-11-28 03:29:10,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-11-28 03:29:10,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:10,220 INFO L206 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-11-28 03:29:10,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:29:10,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:10,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1744375687, now seen corresponding path program 1 times [2024-11-28 03:29:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:10,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095972275] [2024-11-28 03:29:10,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095972275] [2024-11-28 03:29:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095972275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818076502] [2024-11-28 03:29:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:10,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:10,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:10,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-28 03:29:10,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-11-28 03:29:10,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:10,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-28 03:29:10,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:10,435 INFO L124 PetriNetUnfolderBase]: 48/667 cut-off events. [2024-11-28 03:29:10,435 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-28 03:29:10,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 667 events. 48/667 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3465 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 760. Up to 97 conditions per place. [2024-11-28 03:29:10,441 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 12 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2024-11-28 03:29:10,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 343 flow [2024-11-28 03:29:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2024-11-28 03:29:10,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9256756756756757 [2024-11-28 03:29:10,443 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 306 flow. Second operand 3 states and 411 transitions. [2024-11-28 03:29:10,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 343 flow [2024-11-28 03:29:10,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:10,447 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 317 flow [2024-11-28 03:29:10,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2024-11-28 03:29:10,449 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -2 predicate places. [2024-11-28 03:29:10,450 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 317 flow [2024-11-28 03:29:10,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-11-28 03:29:10,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:10,451 INFO L206 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, 1, 1] [2024-11-28 03:29:10,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:29:10,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:10,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash 341691717, now seen corresponding path program 1 times [2024-11-28 03:29:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572869946] [2024-11-28 03:29:10,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572869946] [2024-11-28 03:29:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572869946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746444081] [2024-11-28 03:29:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:10,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:29:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:10,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:29:10,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:29:10,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 148 [2024-11-28 03:29:10,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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-11-28 03:29:10,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:10,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 148 [2024-11-28 03:29:10,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:10,758 INFO L124 PetriNetUnfolderBase]: 12/371 cut-off events. [2024-11-28 03:29:10,758 INFO L125 PetriNetUnfolderBase]: For 29/55 co-relation queries the response was YES. [2024-11-28 03:29:10,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 371 events. 12/371 cut-off events. For 29/55 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1286 event pairs, 1 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 257. Up to 40 conditions per place. [2024-11-28 03:29:10,761 INFO L140 encePairwiseOnDemand]: 140/148 looper letters, 14 selfloop transitions, 2 changer transitions 5/149 dead transitions. [2024-11-28 03:29:10,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 149 transitions, 371 flow [2024-11-28 03:29:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:29:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2024-11-28 03:29:10,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9031531531531531 [2024-11-28 03:29:10,765 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 317 flow. Second operand 6 states and 802 transitions. [2024-11-28 03:29:10,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 149 transitions, 371 flow [2024-11-28 03:29:10,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:10,770 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 339 flow [2024-11-28 03:29:10,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2024-11-28 03:29:10,774 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 7 predicate places. [2024-11-28 03:29:10,774 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 339 flow [2024-11-28 03:29:10,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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-11-28 03:29:10,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:10,775 INFO L206 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, 1, 1] [2024-11-28 03:29:10,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:29:10,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:10,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -207445451, now seen corresponding path program 1 times [2024-11-28 03:29:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932596817] [2024-11-28 03:29:10,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932596817] [2024-11-28 03:29:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932596817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:11,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100149841] [2024-11-28 03:29:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:11,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:11,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:11,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:11,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 148 [2024-11-28 03:29:11,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 144 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-11-28 03:29:11,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:11,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 148 [2024-11-28 03:29:11,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:12,107 INFO L124 PetriNetUnfolderBase]: 1085/3168 cut-off events. [2024-11-28 03:29:12,107 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2024-11-28 03:29:12,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5284 conditions, 3168 events. 1085/3168 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 24835 event pairs, 561 based on Foata normal form. 0/2794 useless extension candidates. Maximal degree in co-relation 4185. Up to 1656 conditions per place. [2024-11-28 03:29:12,133 INFO L140 encePairwiseOnDemand]: 133/148 looper letters, 31 selfloop transitions, 38 changer transitions 0/182 dead transitions. [2024-11-28 03:29:12,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 182 transitions, 558 flow [2024-11-28 03:29:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:29:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2024-11-28 03:29:12,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547297297297297 [2024-11-28 03:29:12,136 INFO L175 Difference]: Start difference. First operand has 155 places, 144 transitions, 339 flow. Second operand 6 states and 759 transitions. [2024-11-28 03:29:12,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 182 transitions, 558 flow [2024-11-28 03:29:12,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 182 transitions, 546 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 03:29:12,142 INFO L231 Difference]: Finished difference. Result has 158 places, 181 transitions, 581 flow [2024-11-28 03:29:12,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=158, PETRI_TRANSITIONS=181} [2024-11-28 03:29:12,143 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 10 predicate places. [2024-11-28 03:29:12,144 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 181 transitions, 581 flow [2024-11-28 03:29:12,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-11-28 03:29:12,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:12,145 INFO L206 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:12,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:29:12,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:12,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash -384964517, now seen corresponding path program 1 times [2024-11-28 03:29:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653112089] [2024-11-28 03:29:12,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:12,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:12,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:12,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653112089] [2024-11-28 03:29:12,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653112089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:12,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:12,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118656114] [2024-11-28 03:29:12,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:12,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:12,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:12,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:12,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 148 [2024-11-28 03:29:12,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 181 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-11-28 03:29:12,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:12,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 148 [2024-11-28 03:29:12,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:12,890 INFO L124 PetriNetUnfolderBase]: 755/3539 cut-off events. [2024-11-28 03:29:12,890 INFO L125 PetriNetUnfolderBase]: For 671/820 co-relation queries the response was YES. [2024-11-28 03:29:12,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6287 conditions, 3539 events. 755/3539 cut-off events. For 671/820 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 32768 event pairs, 148 based on Foata normal form. 0/3276 useless extension candidates. Maximal degree in co-relation 4941. Up to 1042 conditions per place. [2024-11-28 03:29:12,921 INFO L140 encePairwiseOnDemand]: 134/148 looper letters, 21 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2024-11-28 03:29:12,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 194 transitions, 680 flow [2024-11-28 03:29:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-28 03:29:12,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-28 03:29:12,924 INFO L175 Difference]: Start difference. First operand has 158 places, 181 transitions, 581 flow. Second operand 3 states and 416 transitions. [2024-11-28 03:29:12,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 194 transitions, 680 flow [2024-11-28 03:29:12,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 194 transitions, 680 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:12,940 INFO L231 Difference]: Finished difference. Result has 162 places, 191 transitions, 669 flow [2024-11-28 03:29:12,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=162, PETRI_TRANSITIONS=191} [2024-11-28 03:29:12,942 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 14 predicate places. [2024-11-28 03:29:12,942 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 669 flow [2024-11-28 03:29:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-11-28 03:29:12,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:12,943 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:12,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:29:12,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:12,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 769147968, now seen corresponding path program 1 times [2024-11-28 03:29:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101446503] [2024-11-28 03:29:12,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101446503] [2024-11-28 03:29:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101446503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325868244] [2024-11-28 03:29:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:13,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:13,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:13,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-28 03:29:13,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-11-28 03:29:13,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:13,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-28 03:29:13,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:13,871 INFO L124 PetriNetUnfolderBase]: 859/4000 cut-off events. [2024-11-28 03:29:13,872 INFO L125 PetriNetUnfolderBase]: For 907/1142 co-relation queries the response was YES. [2024-11-28 03:29:13,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7320 conditions, 4000 events. 859/4000 cut-off events. For 907/1142 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 39150 event pairs, 162 based on Foata normal form. 5/3709 useless extension candidates. Maximal degree in co-relation 6354. Up to 1186 conditions per place. [2024-11-28 03:29:13,907 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 20 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2024-11-28 03:29:13,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 200 transitions, 769 flow [2024-11-28 03:29:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2024-11-28 03:29:13,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9346846846846847 [2024-11-28 03:29:13,909 INFO L175 Difference]: Start difference. First operand has 162 places, 191 transitions, 669 flow. Second operand 3 states and 415 transitions. [2024-11-28 03:29:13,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 200 transitions, 769 flow [2024-11-28 03:29:13,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:13,924 INFO L231 Difference]: Finished difference. Result has 164 places, 198 transitions, 725 flow [2024-11-28 03:29:13,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=164, PETRI_TRANSITIONS=198} [2024-11-28 03:29:13,925 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 16 predicate places. [2024-11-28 03:29:13,925 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 198 transitions, 725 flow [2024-11-28 03:29:13,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-11-28 03:29:13,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:13,926 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:13,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:29:13,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:13,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash 868833817, now seen corresponding path program 1 times [2024-11-28 03:29:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:13,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081525540] [2024-11-28 03:29:13,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:14,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081525540] [2024-11-28 03:29:14,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081525540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:14,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:14,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108607655] [2024-11-28 03:29:14,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:14,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:14,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:14,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:14,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-11-28 03:29:14,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 198 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-11-28 03:29:14,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:14,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-11-28 03:29:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:16,114 INFO L124 PetriNetUnfolderBase]: 2241/7573 cut-off events. [2024-11-28 03:29:16,114 INFO L125 PetriNetUnfolderBase]: For 2187/7949 co-relation queries the response was YES. [2024-11-28 03:29:16,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16448 conditions, 7573 events. 2241/7573 cut-off events. For 2187/7949 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 78413 event pairs, 603 based on Foata normal form. 241/7116 useless extension candidates. Maximal degree in co-relation 14287. Up to 3715 conditions per place. [2024-11-28 03:29:16,195 INFO L140 encePairwiseOnDemand]: 133/148 looper letters, 64 selfloop transitions, 38 changer transitions 0/237 dead transitions. [2024-11-28 03:29:16,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 237 transitions, 1077 flow [2024-11-28 03:29:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:29:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2024-11-28 03:29:16,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671171171171171 [2024-11-28 03:29:16,199 INFO L175 Difference]: Start difference. First operand has 164 places, 198 transitions, 725 flow. Second operand 6 states and 770 transitions. [2024-11-28 03:29:16,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 237 transitions, 1077 flow [2024-11-28 03:29:16,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 237 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:16,219 INFO L231 Difference]: Finished difference. Result has 172 places, 235 transitions, 1025 flow [2024-11-28 03:29:16,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=172, PETRI_TRANSITIONS=235} [2024-11-28 03:29:16,221 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 24 predicate places. [2024-11-28 03:29:16,221 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 235 transitions, 1025 flow [2024-11-28 03:29:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-11-28 03:29:16,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:16,222 INFO L206 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, 1, 1, 1, 1, 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-11-28 03:29:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:29:16,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:16,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash -575356514, now seen corresponding path program 1 times [2024-11-28 03:29:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375961181] [2024-11-28 03:29:16,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:16,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:16,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375961181] [2024-11-28 03:29:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375961181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:16,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:16,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430271363] [2024-11-28 03:29:16,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:16,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:16,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:16,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:16,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-11-28 03:29:16,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 235 transitions, 1025 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-11-28 03:29:16,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:16,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-11-28 03:29:16,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:19,482 INFO L124 PetriNetUnfolderBase]: 5000/15390 cut-off events. [2024-11-28 03:29:19,482 INFO L125 PetriNetUnfolderBase]: For 8758/10080 co-relation queries the response was YES. [2024-11-28 03:29:19,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39491 conditions, 15390 events. 5000/15390 cut-off events. For 8758/10080 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 163654 event pairs, 784 based on Foata normal form. 8/14319 useless extension candidates. Maximal degree in co-relation 35462. Up to 6565 conditions per place. [2024-11-28 03:29:19,620 INFO L140 encePairwiseOnDemand]: 129/148 looper letters, 127 selfloop transitions, 118 changer transitions 0/382 dead transitions. [2024-11-28 03:29:19,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 382 transitions, 2373 flow [2024-11-28 03:29:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:29:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2024-11-28 03:29:19,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2024-11-28 03:29:19,624 INFO L175 Difference]: Start difference. First operand has 172 places, 235 transitions, 1025 flow. Second operand 6 states and 804 transitions. [2024-11-28 03:29:19,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 382 transitions, 2373 flow [2024-11-28 03:29:19,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 382 transitions, 2241 flow, removed 66 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:19,697 INFO L231 Difference]: Finished difference. Result has 181 places, 347 transitions, 2091 flow [2024-11-28 03:29:19,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2091, PETRI_PLACES=181, PETRI_TRANSITIONS=347} [2024-11-28 03:29:19,698 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 33 predicate places. [2024-11-28 03:29:19,698 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 347 transitions, 2091 flow [2024-11-28 03:29:19,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-11-28 03:29:19,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:19,698 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:19,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:29:19,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -167944211, now seen corresponding path program 1 times [2024-11-28 03:29:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004445824] [2024-11-28 03:29:19,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:19,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:19,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:19,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004445824] [2024-11-28 03:29:19,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004445824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:19,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:19,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745267343] [2024-11-28 03:29:19,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:19,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:19,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:19,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:19,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:19,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-11-28 03:29:19,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 347 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-11-28 03:29:19,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:19,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-11-28 03:29:19,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:21,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] threadEXIT-->L1061-6: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][258], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 156#(= |#race~datas~0| 0), Black: 154#true, Black: 160#(= |ULTIMATE.start_main_~i~0#1| 0), 149#true, Black: 171#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 172#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 146#true, Black: 173#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 27#L1061-6true, Black: 174#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 180#true, 169#true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|), 55#L1048-5true]) [2024-11-28 03:29:21,752 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-28 03:29:21,752 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-28 03:29:21,752 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-28 03:29:21,752 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-28 03:29:21,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] threadEXIT-->L1061-6: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][298], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 213#(= |threadThread2of2ForFork0_#t~nondet4| |#race~next_j~0|), Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 156#(= |#race~datas~0| 0), Black: 154#true, 132#L1048-7true, Black: 160#(= |ULTIMATE.start_main_~i~0#1| 0), 149#true, Black: 171#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 172#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 146#true, Black: 173#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 27#L1061-6true, Black: 174#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 182#(= |#race~next_j~0| 0), 169#true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-11-28 03:29:21,835 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-28 03:29:21,835 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-28 03:29:21,835 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-28 03:29:21,835 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-28 03:29:22,615 INFO L124 PetriNetUnfolderBase]: 3991/13294 cut-off events. [2024-11-28 03:29:22,615 INFO L125 PetriNetUnfolderBase]: For 10292/12194 co-relation queries the response was YES. [2024-11-28 03:29:22,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36962 conditions, 13294 events. 3991/13294 cut-off events. For 10292/12194 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 145966 event pairs, 303 based on Foata normal form. 9/12711 useless extension candidates. Maximal degree in co-relation 33044. Up to 3189 conditions per place. [2024-11-28 03:29:22,768 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 22 selfloop transitions, 11 changer transitions 0/355 dead transitions. [2024-11-28 03:29:22,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 355 transitions, 2190 flow [2024-11-28 03:29:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-28 03:29:22,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9324324324324325 [2024-11-28 03:29:22,771 INFO L175 Difference]: Start difference. First operand has 181 places, 347 transitions, 2091 flow. Second operand 3 states and 414 transitions. [2024-11-28 03:29:22,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 355 transitions, 2190 flow [2024-11-28 03:29:23,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 355 transitions, 2154 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-28 03:29:23,125 INFO L231 Difference]: Finished difference. Result has 185 places, 354 transitions, 2143 flow [2024-11-28 03:29:23,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=185, PETRI_TRANSITIONS=354} [2024-11-28 03:29:23,127 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 37 predicate places. [2024-11-28 03:29:23,127 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 354 transitions, 2143 flow [2024-11-28 03:29:23,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-11-28 03:29:23,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:23,128 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:23,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:29:23,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-28 03:29:23,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:23,129 INFO L85 PathProgramCache]: Analyzing trace with hash 523842148, now seen corresponding path program 1 times [2024-11-28 03:29:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:23,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509812069] [2024-11-28 03:29:23,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:29:23,161 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:29:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:29:23,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:29:23,199 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:29:23,199 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2024-11-28 03:29:23,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-28 03:29:23,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-28 03:29:23,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-28 03:29:23,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-28 03:29:23,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 20 remaining) [2024-11-28 03:29:23,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-28 03:29:23,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-28 03:29:23,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-28 03:29:23,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-28 03:29:23,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-28 03:29:23,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-28 03:29:23,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-28 03:29:23,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-28 03:29:23,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-28 03:29:23,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-28 03:29:23,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-28 03:29:23,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-28 03:29:23,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-28 03:29:23,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-28 03:29:23,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:29:23,202 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:23,271 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-28 03:29:23,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:29:23,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:29:23 BasicIcfg [2024-11-28 03:29:23,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:29:23,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:29:23,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:29:23,282 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:29:23,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:05" (3/4) ... [2024-11-28 03:29:23,284 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:29:23,573 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 6. [2024-11-28 03:29:23,634 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:29:23,635 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:29:23,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:29:23,636 INFO L158 Benchmark]: Toolchain (without parser) took 20119.10ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 90.1MB in the beginning and 725.6MB in the end (delta: -635.5MB). Peak memory consumption was 712.1MB. Max. memory is 16.1GB. [2024-11-28 03:29:23,637 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:23,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.03ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 61.9MB in the end (delta: 28.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:29:23,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.90ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:23,638 INFO L158 Benchmark]: Boogie Preprocessor took 58.73ms. Allocated memory is still 117.4MB. Free memory was 59.9MB in the beginning and 58.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:23,638 INFO L158 Benchmark]: RCFGBuilder took 656.48ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 43.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:29:23,638 INFO L158 Benchmark]: TraceAbstraction took 18221.43ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 42.6MB in the beginning and 466.9MB in the end (delta: -424.3MB). Peak memory consumption was 580.7MB. Max. memory is 16.1GB. [2024-11-28 03:29:23,638 INFO L158 Benchmark]: Witness Printer took 353.56ms. Allocated memory is still 1.1GB. Free memory was 466.9MB in the beginning and 725.6MB in the end (delta: -258.8MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2024-11-28 03:29:23,640 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.27ms. Allocated memory is still 83.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.03ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 61.9MB in the end (delta: 28.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.90ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.73ms. Allocated memory is still 117.4MB. Free memory was 59.9MB in the beginning and 58.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 656.48ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 43.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18221.43ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 42.6MB in the beginning and 466.9MB in the end (delta: -424.3MB). Peak memory consumption was 580.7MB. Max. memory is 16.1GB. * Witness Printer took 353.56ms. Allocated memory is still 1.1GB. Free memory was 466.9MB in the beginning and 725.6MB in the end (delta: -258.8MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1047]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int *datas; VAL [datas={0:0}] [L1044] 0 int next_j = 0; VAL [datas={0:0}, next_j=0] [L1053] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, next_j=0, threads_total=2] [L1054] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, next_j=0] [L1054] RET 0 assume_abort_if_not(threads_total >= 0) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, next_j=0, threads_total=2, tids={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, next_j=0, threads_total=2, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1046] 1 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1047] 1 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1046] 2 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=0] [L1048] 1 next_j++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] Now there is a data race on ~next_j~0 between C: next_j++ [1048] and C: j = next_j [1047] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: 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. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 144 locations, 15 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: 4.6s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 57 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=7, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 179 locations, 20 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: 13.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 960 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 41 mSDtfsCounter, 960 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2143occurred in iteration=9, InterpolantAutomatonStates: 39, 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.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 03:29:23,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c3217-7640-4ad5-9246-768b598e3b37/bin/uautomizer-verify-aQ6SnzHsRB/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(DATA-RACE)