./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme --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 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:57:23,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:57:24,045 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:57:24,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:57:24,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:57:24,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:57:24,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:57:24,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:57:24,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:57:24,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:57:24,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:57:24,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:57:24,084 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:57:24,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:57:24,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:57:24,086 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:57:24,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:57:24,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:57:24,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:57:24,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:57:24,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:57:24,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:57:24,090 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:57:24,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:57:24,090 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:57:24,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:57:24,091 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:57:24,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:57:24,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:57:24,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:57:24,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:24,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:57:24,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:57:24,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:57:24,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:57:24,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:57:24,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:57:24,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:57:24,095 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:57:24,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:57:24,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:57:24,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme 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 -> 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 [2023-11-26 11:57:24,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:57:24,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:57:24,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:57:24,362 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:57:24,362 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:57:24,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2023-11-26 11:57:27,482 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:57:27,894 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:57:27,894 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2023-11-26 11:57:27,924 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/data/95f8e2561/0853ab0fe98242d28550f59c8531cb81/FLAG9d528b2b0 [2023-11-26 11:57:27,939 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/data/95f8e2561/0853ab0fe98242d28550f59c8531cb81 [2023-11-26 11:57:27,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:57:27,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:57:27,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:27,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:57:27,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:57:27,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:27" (1/1) ... [2023-11-26 11:57:27,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4493096e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:27, skipping insertion in model container [2023-11-26 11:57:27,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:57:27" (1/1) ... [2023-11-26 11:57:28,004 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:57:28,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:28,426 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:57:28,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:57:28,568 WARN L675 CHandler]: The function pthread_detach is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:57:28,576 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:57:28,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28 WrapperNode [2023-11-26 11:57:28,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:57:28,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:28,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:57:28,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:57:28,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,633 INFO L138 Inliner]: procedures = 160, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2023-11-26 11:57:28,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:57:28,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:57:28,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:57:28,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:57:28,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:57:28,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:57:28,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:57:28,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:57:28,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (1/1) ... [2023-11-26 11:57:28,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:57:28,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:57:28,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:57:28,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cd4d54b-04f6-4acf-bce4-516a5c07de7a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:57:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:57:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:57:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-26 11:57:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:57:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:57:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:57:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure pthread_detach [2023-11-26 11:57:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:57:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-26 11:57:28,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-26 11:57:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-26 11:57:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:57:28,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:57:28,747 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:57:28,891 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:57:28,894 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:57:29,255 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:57:29,294 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:57:29,295 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:57:29,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:29 BoogieIcfgContainer [2023-11-26 11:57:29,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:57:29,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:57:29,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:57:29,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:57:29,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:57:27" (1/3) ... [2023-11-26 11:57:29,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eac2f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:29, skipping insertion in model container [2023-11-26 11:57:29,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:57:28" (2/3) ... [2023-11-26 11:57:29,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eac2f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:57:29, skipping insertion in model container [2023-11-26 11:57:29,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:57:29" (3/3) ... [2023-11-26 11:57:29,307 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race-5.i [2023-11-26 11:57:29,317 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:57:29,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:57:29,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-26 11:57:29,329 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:57:29,416 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:57:29,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 140 transitions, 284 flow [2023-11-26 11:57:29,537 INFO L124 PetriNetUnfolderBase]: 7/169 cut-off events. [2023-11-26 11:57:29,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:57:29,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 169 events. 7/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 237 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-11-26 11:57:29,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 140 transitions, 284 flow [2023-11-26 11:57:29,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 140 transitions, 284 flow [2023-11-26 11:57:29,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:57:29,569 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52bf7752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:57:29,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-26 11:57:29,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:57:29,586 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2023-11-26 11:57:29,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:57:29,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:29,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:29,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:57:29,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1534193380, now seen corresponding path program 1 times [2023-11-26 11:57:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:29,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603363944] [2023-11-26 11:57:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603363944] [2023-11-26 11:57:29,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603363944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60072029] [2023-11-26 11:57:29,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:29,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:30,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2023-11-26 11:57:30,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 140 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-11-26 11:57:30,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:30,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2023-11-26 11:57:30,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:30,449 INFO L124 PetriNetUnfolderBase]: 122/678 cut-off events. [2023-11-26 11:57:30,450 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:57:30,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 678 events. 122/678 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3521 event pairs, 29 based on Foata normal form. 10/621 useless extension candidates. Maximal degree in co-relation 860. Up to 167 conditions per place. [2023-11-26 11:57:30,462 INFO L140 encePairwiseOnDemand]: 128/140 looper letters, 28 selfloop transitions, 6 changer transitions 1/149 dead transitions. [2023-11-26 11:57:30,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 149 transitions, 370 flow [2023-11-26 11:57:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-26 11:57:30,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9214285714285714 [2023-11-26 11:57:30,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-26 11:57:30,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-26 11:57:30,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:30,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-26 11:57:30,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-11-26 11:57:30,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:30,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:30,511 INFO L175 Difference]: Start difference. First operand has 139 places, 140 transitions, 284 flow. Second operand 3 states and 387 transitions. [2023-11-26 11:57:30,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 149 transitions, 370 flow [2023-11-26 11:57:30,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 149 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:57:30,524 INFO L231 Difference]: Finished difference. Result has 141 places, 138 transitions, 314 flow [2023-11-26 11:57:30,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=141, PETRI_TRANSITIONS=138} [2023-11-26 11:57:30,533 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2023-11-26 11:57:30,533 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 138 transitions, 314 flow [2023-11-26 11:57:30,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-11-26 11:57:30,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:30,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:30,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:57:30,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:57:30,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash -676518336, now seen corresponding path program 1 times [2023-11-26 11:57:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268995507] [2023-11-26 11:57:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:30,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268995507] [2023-11-26 11:57:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268995507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:30,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685814493] [2023-11-26 11:57:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:30,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:30,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:30,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:30,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140 [2023-11-26 11:57:30,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 138 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-11-26 11:57:30,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:30,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140 [2023-11-26 11:57:30,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:30,881 INFO L124 PetriNetUnfolderBase]: 122/775 cut-off events. [2023-11-26 11:57:30,881 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-26 11:57:30,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 775 events. 122/775 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4368 event pairs, 56 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 1042. Up to 170 conditions per place. [2023-11-26 11:57:30,886 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 19 selfloop transitions, 3 changer transitions 1/146 dead transitions. [2023-11-26 11:57:30,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 146 transitions, 376 flow [2023-11-26 11:57:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-11-26 11:57:30,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2023-11-26 11:57:30,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-11-26 11:57:30,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-11-26 11:57:30,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:30,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-11-26 11:57:30,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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) [2023-11-26 11:57:30,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:30,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:30,894 INFO L175 Difference]: Start difference. First operand has 141 places, 138 transitions, 314 flow. Second operand 3 states and 390 transitions. [2023-11-26 11:57:30,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 146 transitions, 376 flow [2023-11-26 11:57:30,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 146 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:30,901 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 324 flow [2023-11-26 11:57:30,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2023-11-26 11:57:30,902 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 3 predicate places. [2023-11-26 11:57:30,902 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 324 flow [2023-11-26 11:57:30,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-11-26 11:57:30,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:30,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:30,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:57:30,904 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:57:30,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 677561039, now seen corresponding path program 1 times [2023-11-26 11:57:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075105007] [2023-11-26 11:57:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:31,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:31,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075105007] [2023-11-26 11:57:31,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075105007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:31,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:31,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:57:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900114027] [2023-11-26 11:57:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:31,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:57:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:31,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:57:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:57:31,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2023-11-26 11:57:31,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 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) [2023-11-26 11:57:31,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:31,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2023-11-26 11:57:31,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:31,997 INFO L124 PetriNetUnfolderBase]: 148/1007 cut-off events. [2023-11-26 11:57:31,997 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-26 11:57:32,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 1007 events. 148/1007 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6277 event pairs, 79 based on Foata normal form. 0/928 useless extension candidates. Maximal degree in co-relation 1349. Up to 216 conditions per place. [2023-11-26 11:57:32,006 INFO L140 encePairwiseOnDemand]: 134/140 looper letters, 40 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2023-11-26 11:57:32,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 163 transitions, 460 flow [2023-11-26 11:57:32,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:57:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:57:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2023-11-26 11:57:32,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2023-11-26 11:57:32,010 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2023-11-26 11:57:32,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2023-11-26 11:57:32,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:32,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2023-11-26 11:57:32,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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) [2023-11-26 11:57:32,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-26 11:57:32,018 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-26 11:57:32,018 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 324 flow. Second operand 6 states and 736 transitions. [2023-11-26 11:57:32,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 163 transitions, 460 flow [2023-11-26 11:57:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 163 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:32,029 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 326 flow [2023-11-26 11:57:32,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2023-11-26 11:57:32,032 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places. [2023-11-26 11:57:32,032 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 326 flow [2023-11-26 11:57:32,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 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) [2023-11-26 11:57:32,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:32,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:32,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:57:32,035 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:57:32,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash 45366021, now seen corresponding path program 1 times [2023-11-26 11:57:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:32,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698258727] [2023-11-26 11:57:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:32,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:32,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698258727] [2023-11-26 11:57:32,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698258727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:32,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317484703] [2023-11-26 11:57:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:32,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:32,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:32,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2023-11-26 11:57:32,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-11-26 11:57:32,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:32,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2023-11-26 11:57:32,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:32,306 INFO L124 PetriNetUnfolderBase]: 146/810 cut-off events. [2023-11-26 11:57:32,307 INFO L125 PetriNetUnfolderBase]: For 73/75 co-relation queries the response was YES. [2023-11-26 11:57:32,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 810 events. 146/810 cut-off events. For 73/75 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4515 event pairs, 73 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 1171. Up to 267 conditions per place. [2023-11-26 11:57:32,313 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 26 selfloop transitions, 5 changer transitions 0/147 dead transitions. [2023-11-26 11:57:32,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 147 transitions, 408 flow [2023-11-26 11:57:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-26 11:57:32,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2023-11-26 11:57:32,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-26 11:57:32,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-26 11:57:32,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:32,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-26 11:57:32,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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) [2023-11-26 11:57:32,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:32,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:32,322 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 326 flow. Second operand 3 states and 379 transitions. [2023-11-26 11:57:32,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 147 transitions, 408 flow [2023-11-26 11:57:32,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 147 transitions, 398 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:57:32,329 INFO L231 Difference]: Finished difference. Result has 143 places, 143 transitions, 358 flow [2023-11-26 11:57:32,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=143, PETRI_TRANSITIONS=143} [2023-11-26 11:57:32,332 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2023-11-26 11:57:32,332 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 358 flow [2023-11-26 11:57:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-11-26 11:57:32,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:32,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:32,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:57:32,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:57:32,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash -482592884, now seen corresponding path program 1 times [2023-11-26 11:57:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402304439] [2023-11-26 11:57:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:32,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402304439] [2023-11-26 11:57:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402304439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:32,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913738980] [2023-11-26 11:57:32,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:32,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:32,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2023-11-26 11:57:32,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 143 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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) [2023-11-26 11:57:32,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:32,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2023-11-26 11:57:32,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:32,629 INFO L124 PetriNetUnfolderBase]: 162/881 cut-off events. [2023-11-26 11:57:32,629 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-26 11:57:32,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 881 events. 162/881 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5220 event pairs, 72 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1320. Up to 244 conditions per place. [2023-11-26 11:57:32,636 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 20 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2023-11-26 11:57:32,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 150 transitions, 424 flow [2023-11-26 11:57:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-26 11:57:32,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2023-11-26 11:57:32,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-26 11:57:32,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-26 11:57:32,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:32,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-26 11:57:32,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2023-11-26 11:57:32,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:32,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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) [2023-11-26 11:57:32,649 INFO L175 Difference]: Start difference. First operand has 143 places, 143 transitions, 358 flow. Second operand 3 states and 385 transitions. [2023-11-26 11:57:32,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 150 transitions, 424 flow [2023-11-26 11:57:32,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 150 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:32,654 INFO L231 Difference]: Finished difference. Result has 145 places, 146 transitions, 384 flow [2023-11-26 11:57:32,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=145, PETRI_TRANSITIONS=146} [2023-11-26 11:57:32,658 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2023-11-26 11:57:32,658 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 146 transitions, 384 flow [2023-11-26 11:57:32,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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) [2023-11-26 11:57:32,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:32,659 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:32,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:57:32,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:57:32,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -351550008, now seen corresponding path program 1 times [2023-11-26 11:57:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509930084] [2023-11-26 11:57:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:57:32,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:57:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:57:32,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:57:32,766 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:57:32,767 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2023-11-26 11:57:32,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-11-26 11:57:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-11-26 11:57:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-11-26 11:57:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-11-26 11:57:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-11-26 11:57:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-11-26 11:57:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-11-26 11:57:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-11-26 11:57:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-11-26 11:57:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-11-26 11:57:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-11-26 11:57:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-11-26 11:57:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-11-26 11:57:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:57:32,773 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 11:57:32,776 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:57:32,776 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 11:57:32,818 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:57:32,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 187 transitions, 384 flow [2023-11-26 11:57:32,866 INFO L124 PetriNetUnfolderBase]: 10/263 cut-off events. [2023-11-26 11:57:32,866 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:57:32,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 263 events. 10/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 514 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 170. Up to 6 conditions per place. [2023-11-26 11:57:32,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 187 transitions, 384 flow [2023-11-26 11:57:32,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 187 transitions, 384 flow [2023-11-26 11:57:32,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:57:32,874 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52bf7752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:57:32,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-26 11:57:32,881 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:57:32,881 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2023-11-26 11:57:32,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:57:32,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:32,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:32,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:32,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1466482335, now seen corresponding path program 1 times [2023-11-26 11:57:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158725026] [2023-11-26 11:57:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158725026] [2023-11-26 11:57:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158725026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:32,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515829572] [2023-11-26 11:57:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:32,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:32,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:32,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:32,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 187 [2023-11-26 11:57:32,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 187 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-11-26 11:57:32,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:32,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 187 [2023-11-26 11:57:32,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:35,589 INFO L124 PetriNetUnfolderBase]: 4627/13622 cut-off events. [2023-11-26 11:57:35,589 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-26 11:57:35,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21032 conditions, 13622 events. 4627/13622 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 141546 event pairs, 1495 based on Foata normal form. 219/12223 useless extension candidates. Maximal degree in co-relation 15104. Up to 4243 conditions per place. [2023-11-26 11:57:35,725 INFO L140 encePairwiseOnDemand]: 165/187 looper letters, 54 selfloop transitions, 14 changer transitions 1/215 dead transitions. [2023-11-26 11:57:35,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 215 transitions, 581 flow [2023-11-26 11:57:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2023-11-26 11:57:35,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9251336898395722 [2023-11-26 11:57:35,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2023-11-26 11:57:35,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2023-11-26 11:57:35,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:35,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2023-11-26 11:57:35,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 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) [2023-11-26 11:57:35,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:35,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:35,733 INFO L175 Difference]: Start difference. First operand has 188 places, 187 transitions, 384 flow. Second operand 3 states and 519 transitions. [2023-11-26 11:57:35,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 215 transitions, 581 flow [2023-11-26 11:57:35,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 215 transitions, 581 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:57:35,739 INFO L231 Difference]: Finished difference. Result has 192 places, 197 transitions, 498 flow [2023-11-26 11:57:35,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=192, PETRI_TRANSITIONS=197} [2023-11-26 11:57:35,741 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 4 predicate places. [2023-11-26 11:57:35,741 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 197 transitions, 498 flow [2023-11-26 11:57:35,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-11-26 11:57:35,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:35,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:57:35,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:35,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1784477024, now seen corresponding path program 1 times [2023-11-26 11:57:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470893849] [2023-11-26 11:57:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:35,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:35,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470893849] [2023-11-26 11:57:35,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470893849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:35,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:35,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:35,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805154997] [2023-11-26 11:57:35,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:35,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:35,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:35,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:35,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 187 [2023-11-26 11:57:35,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 197 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 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) [2023-11-26 11:57:35,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:35,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 187 [2023-11-26 11:57:35,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:38,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [136#L699-1true, 106#L713-1true, Black: 191#true, 193#(= |#race~threads_alive~0| 0), threadThread1of2ForFork0InUse, 97#L699-6true, threadThread2of2ForFork0InUse, 197#true]) [2023-11-26 11:57:38,547 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2023-11-26 11:57:38,547 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-26 11:57:38,547 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-26 11:57:38,547 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-26 11:57:38,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 193#(= |#race~threads_alive~0| 0), threadThread1of2ForFork0InUse, 97#L699-6true, threadThread2of2ForFork0InUse, 197#true, 23#L699-2true]) [2023-11-26 11:57:38,580 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-26 11:57:38,581 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-26 11:57:38,581 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:38,581 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-26 11:57:38,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][52], [106#L713-1true, Black: 191#true, 193#(= |#race~threads_alive~0| 0), 44#L699-6true, threadThread1of2ForFork0InUse, 97#L699-6true, threadThread2of2ForFork0InUse, 197#true]) [2023-11-26 11:57:38,677 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-26 11:57:38,677 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 11:57:38,677 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 11:57:38,677 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:38,760 INFO L124 PetriNetUnfolderBase]: 4194/15418 cut-off events. [2023-11-26 11:57:38,760 INFO L125 PetriNetUnfolderBase]: For 827/872 co-relation queries the response was YES. [2023-11-26 11:57:38,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24424 conditions, 15418 events. 4194/15418 cut-off events. For 827/872 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 176720 event pairs, 2307 based on Foata normal form. 0/13787 useless extension candidates. Maximal degree in co-relation 23224. Up to 4049 conditions per place. [2023-11-26 11:57:38,914 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 34 selfloop transitions, 4 changer transitions 0/212 dead transitions. [2023-11-26 11:57:38,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 212 transitions, 604 flow [2023-11-26 11:57:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2023-11-26 11:57:38,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.93048128342246 [2023-11-26 11:57:38,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2023-11-26 11:57:38,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2023-11-26 11:57:38,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:38,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2023-11-26 11:57:38,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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) [2023-11-26 11:57:38,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:38,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:38,925 INFO L175 Difference]: Start difference. First operand has 192 places, 197 transitions, 498 flow. Second operand 3 states and 522 transitions. [2023-11-26 11:57:38,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 212 transitions, 604 flow [2023-11-26 11:57:38,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 212 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:38,943 INFO L231 Difference]: Finished difference. Result has 193 places, 200 transitions, 500 flow [2023-11-26 11:57:38,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=193, PETRI_TRANSITIONS=200} [2023-11-26 11:57:38,946 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 5 predicate places. [2023-11-26 11:57:38,946 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 200 transitions, 500 flow [2023-11-26 11:57:38,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 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) [2023-11-26 11:57:38,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:38,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:57:38,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:38,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash -439752904, now seen corresponding path program 1 times [2023-11-26 11:57:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824649265] [2023-11-26 11:57:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:39,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824649265] [2023-11-26 11:57:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824649265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:39,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:57:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25454337] [2023-11-26 11:57:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:39,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:57:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:57:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:57:39,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 187 [2023-11-26 11:57:39,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 200 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 156.33333333333334) internal successors, (938), 6 states have internal predecessors, (938), 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) [2023-11-26 11:57:39,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:39,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 187 [2023-11-26 11:57:39,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:42,856 INFO L124 PetriNetUnfolderBase]: 4757/21509 cut-off events. [2023-11-26 11:57:42,856 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2023-11-26 11:57:42,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31867 conditions, 21509 events. 4757/21509 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 268879 event pairs, 2353 based on Foata normal form. 0/19374 useless extension candidates. Maximal degree in co-relation 26515. Up to 4460 conditions per place. [2023-11-26 11:57:43,013 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 71 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2023-11-26 11:57:43,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 247 transitions, 746 flow [2023-11-26 11:57:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:57:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:57:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2023-11-26 11:57:43,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8975044563279857 [2023-11-26 11:57:43,018 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1007 transitions. [2023-11-26 11:57:43,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1007 transitions. [2023-11-26 11:57:43,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:43,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1007 transitions. [2023-11-26 11:57:43,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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) [2023-11-26 11:57:43,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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) [2023-11-26 11:57:43,027 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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) [2023-11-26 11:57:43,027 INFO L175 Difference]: Start difference. First operand has 193 places, 200 transitions, 500 flow. Second operand 6 states and 1007 transitions. [2023-11-26 11:57:43,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 247 transitions, 746 flow [2023-11-26 11:57:43,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 247 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:43,052 INFO L231 Difference]: Finished difference. Result has 195 places, 199 transitions, 500 flow [2023-11-26 11:57:43,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=195, PETRI_TRANSITIONS=199} [2023-11-26 11:57:43,054 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 7 predicate places. [2023-11-26 11:57:43,055 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 199 transitions, 500 flow [2023-11-26 11:57:43,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.33333333333334) internal successors, (938), 6 states have internal predecessors, (938), 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) [2023-11-26 11:57:43,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:43,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:43,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:57:43,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:43,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 48496782, now seen corresponding path program 1 times [2023-11-26 11:57:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177218938] [2023-11-26 11:57:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177218938] [2023-11-26 11:57:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177218938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:43,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:43,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452072832] [2023-11-26 11:57:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:43,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:43,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 187 [2023-11-26 11:57:43,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 199 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-11-26 11:57:43,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:43,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 187 [2023-11-26 11:57:43,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:43,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][162], [106#L713-1true, Black: 191#true, 162#L692-2true, 210#true, Black: 199#(= |#race~data~0| 0), 98#L692-7true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:43,634 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-26 11:57:43,634 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 11:57:43,634 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 11:57:43,634 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 11:57:43,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 162#L692-2true, Black: 199#(= |#race~data~0| 0), 210#true, 108#L694true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:43,721 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-26 11:57:43,721 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-26 11:57:43,721 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-26 11:57:43,721 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-26 11:57:43,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 162#L692-2true, Black: 199#(= |#race~data~0| 0), 210#true, threadThread1of2ForFork0InUse, 159#L694-3true, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:43,756 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-26 11:57:43,756 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-26 11:57:43,757 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-26 11:57:43,757 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-26 11:57:43,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 162#L692-2true, 122#L695-3true, Black: 199#(= |#race~data~0| 0), 210#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:43,818 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-26 11:57:43,819 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-26 11:57:43,819 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-26 11:57:43,819 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-26 11:57:44,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 185#L697-3true, 162#L692-2true, 210#true, Black: 199#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:44,083 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-11-26 11:57:44,083 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-26 11:57:44,083 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-26 11:57:44,083 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-26 11:57:44,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 162#L692-2true, 210#true, Black: 199#(= |#race~data~0| 0), 93#L698-3true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:44,284 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2023-11-26 11:57:44,284 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:57:44,284 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:57:44,284 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:57:44,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][162], [106#L713-1true, Black: 191#true, 145#L699-2true, 210#true, Black: 199#(= |#race~data~0| 0), 98#L692-7true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:44,610 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-26 11:57:44,610 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:44,610 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:44,611 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:57:44,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 145#L699-2true, Black: 199#(= |#race~data~0| 0), 210#true, 108#L694true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:44,730 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-26 11:57:44,730 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-26 11:57:44,731 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:57:44,731 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:57:44,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 145#L699-2true, 210#true, Black: 199#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, 159#L694-3true, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:44,767 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-26 11:57:44,767 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:57:44,767 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:57:44,767 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 11:57:44,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 122#L695-3true, 145#L699-2true, Black: 199#(= |#race~data~0| 0), 210#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:44,994 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-26 11:57:44,994 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 11:57:44,995 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 11:57:44,995 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:57:45,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, 185#L697-3true, Black: 191#true, 145#L699-2true, 210#true, Black: 199#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:45,305 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-26 11:57:45,305 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:57:45,305 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-26 11:57:45,305 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:57:45,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 145#L699-2true, 210#true, Black: 199#(= |#race~data~0| 0), 93#L698-3true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 203#true]) [2023-11-26 11:57:45,353 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:57:45,353 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:57:45,353 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:57:45,353 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:45,768 INFO L124 PetriNetUnfolderBase]: 5725/18519 cut-off events. [2023-11-26 11:57:45,768 INFO L125 PetriNetUnfolderBase]: For 2695/2969 co-relation queries the response was YES. [2023-11-26 11:57:45,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32127 conditions, 18519 events. 5725/18519 cut-off events. For 2695/2969 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 208518 event pairs, 3047 based on Foata normal form. 98/16706 useless extension candidates. Maximal degree in co-relation 30754. Up to 7701 conditions per place. [2023-11-26 11:57:45,897 INFO L140 encePairwiseOnDemand]: 178/187 looper letters, 49 selfloop transitions, 14 changer transitions 0/222 dead transitions. [2023-11-26 11:57:45,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 222 transitions, 697 flow [2023-11-26 11:57:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-11-26 11:57:45,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9073083778966132 [2023-11-26 11:57:45,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-11-26 11:57:45,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-11-26 11:57:45,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:45,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-11-26 11:57:45,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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) [2023-11-26 11:57:45,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:45,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:45,905 INFO L175 Difference]: Start difference. First operand has 195 places, 199 transitions, 500 flow. Second operand 3 states and 509 transitions. [2023-11-26 11:57:45,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 222 transitions, 697 flow [2023-11-26 11:57:45,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 222 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:57:45,912 INFO L231 Difference]: Finished difference. Result has 194 places, 211 transitions, 616 flow [2023-11-26 11:57:45,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=194, PETRI_TRANSITIONS=211} [2023-11-26 11:57:45,914 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 6 predicate places. [2023-11-26 11:57:45,914 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 211 transitions, 616 flow [2023-11-26 11:57:45,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-11-26 11:57:45,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:45,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:45,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:57:45,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:45,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2112248789, now seen corresponding path program 1 times [2023-11-26 11:57:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:45,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834230729] [2023-11-26 11:57:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834230729] [2023-11-26 11:57:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834230729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469226129] [2023-11-26 11:57:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:45,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:45,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2023-11-26 11:57:45,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 211 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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) [2023-11-26 11:57:45,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:45,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2023-11-26 11:57:45,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:46,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][159], [106#L713-1true, Black: 191#true, 162#L692-2true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 210#true, 98#L692-7true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:46,344 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-26 11:57:46,344 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 11:57:46,344 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 11:57:46,344 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 11:57:46,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 162#L692-2true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 210#true, 108#L694true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:46,426 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-26 11:57:46,426 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-26 11:57:46,426 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-26 11:57:46,426 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-26 11:57:47,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][159], [106#L713-1true, Black: 191#true, 145#L699-2true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 210#true, 98#L692-7true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 216#true]) [2023-11-26 11:57:47,471 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,471 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:47,471 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:47,471 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,472 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][159], [106#L713-1true, Black: 191#true, 145#L699-2true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 199#(= |#race~data~0| 0), 98#L692-7true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 216#true]) [2023-11-26 11:57:47,472 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,472 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:47,472 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:47,472 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,472 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L699-->L699-1: Formula: (= |v_#race~threads_alive~0_10| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|} AuxVars[] AssignedVars[#race~threads_alive~0][225], [111#L699-1true, Black: 191#true, 14#L713-2true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 199#(= |#race~data~0| 0), 98#L692-7true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:47,517 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,517 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:47,517 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,517 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:47,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][159], [111#L699-1true, 106#L713-1true, Black: 191#true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 210#true, 98#L692-7true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:47,537 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-26 11:57:47,537 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:57:47,538 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:57:47,538 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:57:47,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, 145#L699-2true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 199#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 216#true, 10#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-26 11:57:47,636 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,636 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:57:47,636 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,636 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:57:47,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [106#L713-1true, Black: 191#true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 145#L699-2true, 210#true, Black: 199#(= |#race~data~0| 0), 108#L694true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 216#true]) [2023-11-26 11:57:47,660 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-26 11:57:47,660 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-26 11:57:47,660 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:57:47,661 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:57:48,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][224], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 181#L701-3true, 85#L696-6true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 197#true, threadThread1of2ForFork0InUse, 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:48,441 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,441 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,442 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,442 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][208], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 33#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 181#L701-3true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 197#true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:48,442 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,442 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,442 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,443 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][208], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 181#L701-3true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, 56#L696-5true, Black: 197#true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:48,443 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,443 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,443 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,443 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][208], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 181#L701-3true, 85#L696-6true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 197#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 216#true]) [2023-11-26 11:57:48,478 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,479 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,479 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,479 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,511 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][208], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 181#L701-3true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, 56#L696-5true, Black: 197#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 216#true]) [2023-11-26 11:57:48,512 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,512 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,512 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,512 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,512 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:48,515 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][208], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 33#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 181#L701-3true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 197#true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:48,515 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,516 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,516 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,516 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,516 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,543 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][224], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 181#L701-3true, 85#L696-6true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 197#true, threadThread1of2ForFork0InUse, 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:48,543 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,543 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,543 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,543 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,544 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,547 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][208], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 181#L701-3true, 85#L696-6true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 210#true, Black: 197#true, threadThread1of2ForFork0InUse, 216#true, threadThread2of2ForFork0InUse]) [2023-11-26 11:57:48,547 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,547 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,548 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,548 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,548 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:48,783 INFO L124 PetriNetUnfolderBase]: 5576/20559 cut-off events. [2023-11-26 11:57:48,784 INFO L125 PetriNetUnfolderBase]: For 3258/3653 co-relation queries the response was YES. [2023-11-26 11:57:48,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35131 conditions, 20559 events. 5576/20559 cut-off events. For 3258/3653 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 246903 event pairs, 2901 based on Foata normal form. 22/18419 useless extension candidates. Maximal degree in co-relation 23535. Up to 5966 conditions per place. [2023-11-26 11:57:48,961 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 36 selfloop transitions, 7 changer transitions 0/227 dead transitions. [2023-11-26 11:57:48,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 227 transitions, 745 flow [2023-11-26 11:57:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-11-26 11:57:48,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9233511586452763 [2023-11-26 11:57:48,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-11-26 11:57:48,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-11-26 11:57:48,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:48,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-11-26 11:57:48,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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) [2023-11-26 11:57:48,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:48,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:48,972 INFO L175 Difference]: Start difference. First operand has 194 places, 211 transitions, 616 flow. Second operand 3 states and 518 transitions. [2023-11-26 11:57:48,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 227 transitions, 745 flow [2023-11-26 11:57:48,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 227 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:48,992 INFO L231 Difference]: Finished difference. Result has 196 places, 216 transitions, 644 flow [2023-11-26 11:57:48,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=196, PETRI_TRANSITIONS=216} [2023-11-26 11:57:48,995 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 8 predicate places. [2023-11-26 11:57:48,995 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 216 transitions, 644 flow [2023-11-26 11:57:48,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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) [2023-11-26 11:57:48,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:48,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:48,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:57:48,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:49,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash -751814599, now seen corresponding path program 1 times [2023-11-26 11:57:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:49,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811558] [2023-11-26 11:57:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:57:49,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811558] [2023-11-26 11:57:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:49,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:49,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:57:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730959116] [2023-11-26 11:57:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:49,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:49,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2023-11-26 11:57:49,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 216 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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) [2023-11-26 11:57:49,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:49,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2023-11-26 11:57:49,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:50,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][218], [Black: 193#(= |#race~threads_alive~0| 0), 154#L716-1true, 185#L697-3true, 181#L701-3true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse, 216#true, 222#true]) [2023-11-26 11:57:50,743 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-26 11:57:50,743 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:50,743 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:50,743 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:50,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread2of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread2of2ForFork0_#t~nondet11=|v_threadThread2of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet11][218], [Black: 193#(= |#race~threads_alive~0| 0), 185#L697-3true, 181#L701-3true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 138#L716-2true, Black: 199#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse, 216#true, 222#true]) [2023-11-26 11:57:50,759 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-26 11:57:50,759 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 11:57:50,759 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 11:57:50,759 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 11:57:50,887 INFO L124 PetriNetUnfolderBase]: 1953/11059 cut-off events. [2023-11-26 11:57:50,887 INFO L125 PetriNetUnfolderBase]: For 1621/2097 co-relation queries the response was YES. [2023-11-26 11:57:50,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17913 conditions, 11059 events. 1953/11059 cut-off events. For 1621/2097 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 132402 event pairs, 488 based on Foata normal form. 287/10388 useless extension candidates. Maximal degree in co-relation 12210. Up to 1500 conditions per place. [2023-11-26 11:57:50,948 INFO L140 encePairwiseOnDemand]: 173/187 looper letters, 16 selfloop transitions, 14 changer transitions 0/223 dead transitions. [2023-11-26 11:57:50,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 223 transitions, 707 flow [2023-11-26 11:57:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2023-11-26 11:57:50,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.946524064171123 [2023-11-26 11:57:50,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2023-11-26 11:57:50,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2023-11-26 11:57:50,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:50,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2023-11-26 11:57:50,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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) [2023-11-26 11:57:50,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:50,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:50,963 INFO L175 Difference]: Start difference. First operand has 196 places, 216 transitions, 644 flow. Second operand 3 states and 531 transitions. [2023-11-26 11:57:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 223 transitions, 707 flow [2023-11-26 11:57:50,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 223 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:50,975 INFO L231 Difference]: Finished difference. Result has 197 places, 220 transitions, 680 flow [2023-11-26 11:57:50,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=197, PETRI_TRANSITIONS=220} [2023-11-26 11:57:50,976 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 9 predicate places. [2023-11-26 11:57:50,977 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 220 transitions, 680 flow [2023-11-26 11:57:50,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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) [2023-11-26 11:57:50,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:50,978 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:50,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:57:50,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:50,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -679276849, now seen corresponding path program 1 times [2023-11-26 11:57:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:50,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460140332] [2023-11-26 11:57:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 11:57:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:51,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460140332] [2023-11-26 11:57:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460140332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:51,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:51,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:51,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970639555] [2023-11-26 11:57:51,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:51,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 187 [2023-11-26 11:57:51,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 220 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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) [2023-11-26 11:57:51,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:51,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 187 [2023-11-26 11:57:51,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:53,052 INFO L124 PetriNetUnfolderBase]: 3079/13613 cut-off events. [2023-11-26 11:57:53,052 INFO L125 PetriNetUnfolderBase]: For 7344/8135 co-relation queries the response was YES. [2023-11-26 11:57:53,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28373 conditions, 13613 events. 3079/13613 cut-off events. For 7344/8135 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 161061 event pairs, 1220 based on Foata normal form. 60/12593 useless extension candidates. Maximal degree in co-relation 27136. Up to 5011 conditions per place. [2023-11-26 11:57:53,303 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 60 selfloop transitions, 10 changer transitions 0/236 dead transitions. [2023-11-26 11:57:53,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 236 transitions, 889 flow [2023-11-26 11:57:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-11-26 11:57:53,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8983957219251337 [2023-11-26 11:57:53,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-11-26 11:57:53,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-11-26 11:57:53,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:53,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-11-26 11:57:53,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2023-11-26 11:57:53,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:53,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:53,313 INFO L175 Difference]: Start difference. First operand has 197 places, 220 transitions, 680 flow. Second operand 3 states and 504 transitions. [2023-11-26 11:57:53,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 236 transitions, 889 flow [2023-11-26 11:57:53,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 236 transitions, 868 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:57:53,327 INFO L231 Difference]: Finished difference. Result has 200 places, 228 transitions, 756 flow [2023-11-26 11:57:53,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=200, PETRI_TRANSITIONS=228} [2023-11-26 11:57:53,328 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 12 predicate places. [2023-11-26 11:57:53,328 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 228 transitions, 756 flow [2023-11-26 11:57:53,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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) [2023-11-26 11:57:53,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:53,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:53,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:57:53,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:53,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1063272518, now seen corresponding path program 1 times [2023-11-26 11:57:53,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:53,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749027391] [2023-11-26 11:57:53,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:53,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749027391] [2023-11-26 11:57:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749027391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:53,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:53,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068467521] [2023-11-26 11:57:53,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:53,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:53,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:53,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 187 [2023-11-26 11:57:53,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 228 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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) [2023-11-26 11:57:53,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:53,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 187 [2023-11-26 11:57:53,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:55,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][221], [Black: 191#true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 233#true, 145#L699-2true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 106#L713-1true, 101#L699-7true, 227#true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:55,611 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-26 11:57:55,611 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 11:57:55,611 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:55,611 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:55,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [20#L701true, Black: 191#true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 145#L699-2true, 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 106#L713-1true, 227#true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:55,911 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-26 11:57:55,911 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 11:57:55,911 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:57:55,911 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:57:55,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [Black: 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), Black: 191#true, 233#true, 145#L699-2true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 106#L713-1true, 227#true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 35#L701-3true, threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:55,940 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-26 11:57:55,940 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:55,940 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:55,940 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 11:57:56,079 INFO L124 PetriNetUnfolderBase]: 4349/16689 cut-off events. [2023-11-26 11:57:56,079 INFO L125 PetriNetUnfolderBase]: For 12386/13201 co-relation queries the response was YES. [2023-11-26 11:57:56,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36358 conditions, 16689 events. 4349/16689 cut-off events. For 12386/13201 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 196320 event pairs, 1508 based on Foata normal form. 55/15441 useless extension candidates. Maximal degree in co-relation 34822. Up to 6370 conditions per place. [2023-11-26 11:57:56,182 INFO L140 encePairwiseOnDemand]: 178/187 looper letters, 71 selfloop transitions, 16 changer transitions 0/255 dead transitions. [2023-11-26 11:57:56,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 255 transitions, 1067 flow [2023-11-26 11:57:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-11-26 11:57:56,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9073083778966132 [2023-11-26 11:57:56,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-11-26 11:57:56,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-11-26 11:57:56,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:56,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-11-26 11:57:56,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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) [2023-11-26 11:57:56,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:56,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:56,189 INFO L175 Difference]: Start difference. First operand has 200 places, 228 transitions, 756 flow. Second operand 3 states and 509 transitions. [2023-11-26 11:57:56,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 255 transitions, 1067 flow [2023-11-26 11:57:56,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 255 transitions, 1039 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:56,222 INFO L231 Difference]: Finished difference. Result has 202 places, 240 transitions, 894 flow [2023-11-26 11:57:56,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=202, PETRI_TRANSITIONS=240} [2023-11-26 11:57:56,224 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 14 predicate places. [2023-11-26 11:57:56,224 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 240 transitions, 894 flow [2023-11-26 11:57:56,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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) [2023-11-26 11:57:56,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:56,225 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:56,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:57:56,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:56,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1058579222, now seen corresponding path program 1 times [2023-11-26 11:57:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:56,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243945035] [2023-11-26 11:57:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 11:57:56,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243945035] [2023-11-26 11:57:56,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243945035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:56,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:56,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362666704] [2023-11-26 11:57:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:56,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:57:56,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2023-11-26 11:57:56,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 240 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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) [2023-11-26 11:57:56,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:57:56,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2023-11-26 11:57:56,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:57:58,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L699-->L699-1: Formula: (= |v_#race~threads_alive~0_10| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|} AuxVars[] AssignedVars[#race~threads_alive~0][177], [111#L699-1true, 154#L716-1true, Black: 191#true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse, 23#L699-2true]) [2023-11-26 11:57:58,652 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:57:58,652 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:58,652 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:58,652 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:57:58,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread1of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread1of2ForFork0_#t~nondet11=|v_threadThread1of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~nondet11][198], [Black: 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 170#L697-3true, 154#L716-1true, Black: 193#(= |#race~threads_alive~0| 0), 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 35#L701-3true, threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:58,907 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-26 11:57:58,907 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:58,907 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:58,907 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:57:58,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][220], [Black: 191#true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 145#L699-2true, 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), 106#L713-1true, 101#L699-7true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:58,972 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-26 11:57:58,972 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 11:57:58,972 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:58,972 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:57:58,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L699-->L699-1: Formula: (= |v_#race~threads_alive~0_10| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|} AuxVars[] AssignedVars[#race~threads_alive~0][243], [111#L699-1true, 154#L716-1true, Black: 191#true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), 101#L699-7true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:58,999 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is not cut-off event [2023-11-26 11:57:58,999 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2023-11-26 11:57:58,999 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2023-11-26 11:57:58,999 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2023-11-26 11:57:59,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_57| (store |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33| (store (select |v_#pthreadsMutex_58| |v_~#threads_alive_mutex~0.base_33|) |v_~#threads_alive_mutex~0.offset_33| 0))) (= |v_threadThread1of2ForFork0_#t~nondet11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_58|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_57|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_33|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_33|, threadThread1of2ForFork0_#t~nondet11=|v_threadThread1of2ForFork0_#t~nondet11_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~nondet11][141], [Black: 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 154#L716-1true, Black: 193#(= |#race~threads_alive~0| 0), 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 35#L701-3true, 22#L698-3true, threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:59,033 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is not cut-off event [2023-11-26 11:57:59,033 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2023-11-26 11:57:59,033 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2023-11-26 11:57:59,034 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2023-11-26 11:57:59,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [111#L699-1true, Black: 191#true, 20#L701true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), 106#L713-1true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:59,048 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-26 11:57:59,048 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-26 11:57:59,048 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-26 11:57:59,048 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 11:57:59,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [Black: 191#true, 20#L701true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 145#L699-2true, 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), 106#L713-1true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:59,049 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-26 11:57:59,049 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:57:59,049 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 11:57:59,049 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:57:59,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L699-->L699-1: Formula: (= |v_#race~threads_alive~0_10| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|} AuxVars[] AssignedVars[#race~threads_alive~0][174], [111#L699-1true, 154#L716-1true, Black: 191#true, 20#L701true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:59,071 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is not cut-off event [2023-11-26 11:57:59,071 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is not cut-off event [2023-11-26 11:57:59,071 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is not cut-off event [2023-11-26 11:57:59,071 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is not cut-off event [2023-11-26 11:57:59,084 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([413] L713-4-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][78], [20#L701true, Black: 191#true, 224#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), 145#L699-2true, 233#true, Black: 229#(= |threadThread2of2ForFork0_#t~nondet2| |#race~threads_alive~0|), Black: 199#(= |#race~data~0| 0), 239#true, Black: 235#(= |threadThread1of2ForFork0_#t~nondet10| |#race~threads_alive~0|), 106#L713-1true, Black: 212#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), threadThread1of2ForFork0InUse, Black: 218#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-26 11:57:59,084 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-26 11:57:59,084 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:57:59,084 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 11:57:59,084 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 11:57:59,084 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:57:59,248 INFO L124 PetriNetUnfolderBase]: 4852/19705 cut-off events. [2023-11-26 11:57:59,248 INFO L125 PetriNetUnfolderBase]: For 15026/16733 co-relation queries the response was YES. [2023-11-26 11:57:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43189 conditions, 19705 events. 4852/19705 cut-off events. For 15026/16733 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 244230 event pairs, 1617 based on Foata normal form. 32/18246 useless extension candidates. Maximal degree in co-relation 41682. Up to 5336 conditions per place. [2023-11-26 11:57:59,396 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 48 selfloop transitions, 10 changer transitions 0/260 dead transitions. [2023-11-26 11:57:59,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 260 transitions, 1092 flow [2023-11-26 11:57:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:57:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:57:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2023-11-26 11:57:59,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2023-11-26 11:57:59,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2023-11-26 11:57:59,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2023-11-26 11:57:59,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:57:59,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2023-11-26 11:57:59,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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) [2023-11-26 11:57:59,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:59,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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) [2023-11-26 11:57:59,406 INFO L175 Difference]: Start difference. First operand has 202 places, 240 transitions, 894 flow. Second operand 3 states and 517 transitions. [2023-11-26 11:57:59,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 260 transitions, 1092 flow [2023-11-26 11:57:59,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 260 transitions, 1040 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-26 11:57:59,495 INFO L231 Difference]: Finished difference. Result has 204 places, 246 transitions, 924 flow [2023-11-26 11:57:59,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=924, PETRI_PLACES=204, PETRI_TRANSITIONS=246} [2023-11-26 11:57:59,498 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 16 predicate places. [2023-11-26 11:57:59,498 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 246 transitions, 924 flow [2023-11-26 11:57:59,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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) [2023-11-26 11:57:59,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:59,500 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-26 11:57:59,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:57:59,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-26 11:57:59,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1721429081, now seen corresponding path program 1 times [2023-11-26 11:57:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767807313] [2023-11-26 11:57:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:57:59,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:57:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:57:59,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:57:59,599 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:57:59,600 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2023-11-26 11:57:59,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-11-26 11:57:59,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-11-26 11:57:59,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-11-26 11:57:59,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-11-26 11:57:59,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2023-11-26 11:57:59,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-11-26 11:57:59,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-11-26 11:57:59,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-11-26 11:57:59,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-11-26 11:57:59,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-11-26 11:57:59,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2023-11-26 11:57:59,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-11-26 11:57:59,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-11-26 11:57:59,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2023-11-26 11:57:59,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-11-26 11:57:59,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-11-26 11:57:59,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-11-26 11:57:59,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-11-26 11:57:59,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:57:59,605 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:59,607 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:57:59,607 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 11:57:59,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:57:59,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 234 transitions, 486 flow [2023-11-26 11:57:59,949 INFO L124 PetriNetUnfolderBase]: 13/357 cut-off events. [2023-11-26 11:57:59,949 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 11:57:59,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 357 events. 13/357 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 773 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 267. Up to 8 conditions per place. [2023-11-26 11:57:59,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 234 transitions, 486 flow [2023-11-26 11:57:59,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 234 transitions, 486 flow [2023-11-26 11:57:59,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:57:59,957 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52bf7752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:57:59,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-26 11:57:59,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:57:59,961 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2023-11-26 11:57:59,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:57:59,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:57:59,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:57:59,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-26 11:57:59,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:57:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -409730679, now seen corresponding path program 1 times [2023-11-26 11:57:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:57:59,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909024501] [2023-11-26 11:57:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:57:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:57:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:57:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:57:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:57:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909024501] [2023-11-26 11:57:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909024501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:57:59,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:57:59,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:57:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749884985] [2023-11-26 11:57:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:57:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:57:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:57:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:57:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:00,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 234 [2023-11-26 11:58:00,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 234 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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) [2023-11-26 11:58:00,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:00,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 234 [2023-11-26 11:58:00,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand