./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-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_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/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_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/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_f85d3711-937c-430e-acbc-f8bee7d9861a/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 b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:46:14,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:46:14,773 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:46:14,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:46:14,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:46:14,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:46:14,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:46:14,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:46:14,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:46:14,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:46:14,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:46:14,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:46:14,836 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:46:14,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:46:14,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:46:14,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:46:14,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:46:14,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:46:14,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:46:14,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:46:14,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:46:14,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:46:14,842 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:46:14,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:46:14,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:46:14,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:46:14,844 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:46:14,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:46:14,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:46:14,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:46:14,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:14,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:46:14,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:46:14,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:46:14,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:46:14,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:46:14,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:46:14,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:46:14,850 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:46:14,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:46:14,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:46:14,851 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_f85d3711-937c-430e-acbc-f8bee7d9861a/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_f85d3711-937c-430e-acbc-f8bee7d9861a/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 -> b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 [2023-11-26 10:46:15,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:46:15,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:46:15,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:46:15,151 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:46:15,151 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:46:15,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-deagle/airline-5.i [2023-11-26 10:46:18,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:46:18,604 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:46:18,605 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/sv-benchmarks/c/pthread-deagle/airline-5.i [2023-11-26 10:46:18,625 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/data/d8a8a2cea/5b8fe1fe642b4bc89f97fd71532038d3/FLAGf8dec471d [2023-11-26 10:46:18,640 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/data/d8a8a2cea/5b8fe1fe642b4bc89f97fd71532038d3 [2023-11-26 10:46:18,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:46:18,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:46:18,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:18,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:46:18,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:46:18,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4863259d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18, skipping insertion in model container [2023-11-26 10:46:18,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,719 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:46:19,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:19,168 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:46:19,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:19,294 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:19,294 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:19,303 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:46:19,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19 WrapperNode [2023-11-26 10:46:19,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:19,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:19,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:46:19,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:46:19,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,368 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2023-11-26 10:46:19,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:19,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:46:19,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:46:19,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:46:19,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:46:19,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:46:19,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:46:19,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:46:19,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (1/1) ... [2023-11-26 10:46:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:19,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:46:19,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:46:19,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:46:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:46:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:46:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:46:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:46:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:46:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2023-11-26 10:46:19,492 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2023-11-26 10:46:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:46:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:46:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:46:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:46:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:46:19,497 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 10:46:19,731 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:46:19,734 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:46:19,994 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:46:20,069 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:46:20,070 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 10:46:20,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:20 BoogieIcfgContainer [2023-11-26 10:46:20,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:46:20,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:46:20,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:46:20,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:46:20,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:46:18" (1/3) ... [2023-11-26 10:46:20,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5906deb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:20, skipping insertion in model container [2023-11-26 10:46:20,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:19" (2/3) ... [2023-11-26 10:46:20,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5906deb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:20, skipping insertion in model container [2023-11-26 10:46:20,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:20" (3/3) ... [2023-11-26 10:46:20,082 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-5.i [2023-11-26 10:46:20,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:46:20,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:46:20,103 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 10:46:20,103 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:46:20,152 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-26 10:46:20,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 92 transitions, 191 flow [2023-11-26 10:46:20,264 INFO L124 PetriNetUnfolderBase]: 11/131 cut-off events. [2023-11-26 10:46:20,264 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:46:20,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 131 events. 11/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 322 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-11-26 10:46:20,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 92 transitions, 191 flow [2023-11-26 10:46:20,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 92 transitions, 191 flow [2023-11-26 10:46:20,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:46:20,294 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;@7e092854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:46:20,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-26 10:46:20,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:46:20,301 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 10:46:20,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:20,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:20,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:20,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:46:20,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:20,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1557855436, now seen corresponding path program 1 times [2023-11-26 10:46:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997382445] [2023-11-26 10:46:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:20,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:20,523 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 10:46:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:20,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997382445] [2023-11-26 10:46:20,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997382445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:20,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:20,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202878755] [2023-11-26 10:46:20,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:46:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:46:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:46:20,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 92 [2023-11-26 10:46:20,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 191 flow. Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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 10:46:20,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:20,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 92 [2023-11-26 10:46:20,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:20,657 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-11-26 10:46:20,658 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2023-11-26 10:46:20,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 264 event pairs, 0 based on Foata normal form. 10/108 useless extension candidates. Maximal degree in co-relation 56. Up to 8 conditions per place. [2023-11-26 10:46:20,660 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 7 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2023-11-26 10:46:20,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 181 flow [2023-11-26 10:46:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:46:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:46:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2023-11-26 10:46:20,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9021739130434783 [2023-11-26 10:46:20,676 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 166 transitions. [2023-11-26 10:46:20,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 166 transitions. [2023-11-26 10:46:20,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:20,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 166 transitions. [2023-11-26 10:46:20,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 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 10:46:20,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 10:46:20,689 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 10:46:20,691 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 191 flow. Second operand 2 states and 166 transitions. [2023-11-26 10:46:20,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 181 flow [2023-11-26 10:46:20,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:46:20,698 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 167 flow [2023-11-26 10:46:20,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=167, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-26 10:46:20,704 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -7 predicate places. [2023-11-26 10:46:20,704 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 167 flow [2023-11-26 10:46:20,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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 10:46:20,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:20,705 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] [2023-11-26 10:46:20,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:46:20,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:46:20,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash -974512921, now seen corresponding path program 1 times [2023-11-26 10:46:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:20,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912741493] [2023-11-26 10:46:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:20,878 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 10:46:20,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912741493] [2023-11-26 10:46:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912741493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:20,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:46:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370969552] [2023-11-26 10:46:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:20,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:20,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:20,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:20,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:20,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-26 10:46:20,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 10:46:20,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:20,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-26 10:46:20,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:20,997 INFO L124 PetriNetUnfolderBase]: 10/152 cut-off events. [2023-11-26 10:46:20,997 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:46:20,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 152 events. 10/152 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 378 event pairs, 0 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 181. Up to 23 conditions per place. [2023-11-26 10:46:21,001 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 13 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-26 10:46:21,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 201 flow [2023-11-26 10:46:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-26 10:46:21,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8079710144927537 [2023-11-26 10:46:21,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-26 10:46:21,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-26 10:46:21,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:21,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-26 10:46:21,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 10:46:21,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 10:46:21,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 10:46:21,018 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 167 flow. Second operand 3 states and 223 transitions. [2023-11-26 10:46:21,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 201 flow [2023-11-26 10:46:21,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:46:21,022 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 175 flow [2023-11-26 10:46:21,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2023-11-26 10:46:21,024 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-26 10:46:21,024 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 175 flow [2023-11-26 10:46:21,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 10:46:21,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,025 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] [2023-11-26 10:46:21,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:46:21,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:46:21,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -929159752, now seen corresponding path program 1 times [2023-11-26 10:46:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806216892] [2023-11-26 10:46:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,090 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 10:46:21,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:21,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806216892] [2023-11-26 10:46:21,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806216892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:21,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:21,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552272311] [2023-11-26 10:46:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:21,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:21,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:21,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 92 [2023-11-26 10:46:21,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:21,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 92 [2023-11-26 10:46:21,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:21,134 INFO L124 PetriNetUnfolderBase]: 1/141 cut-off events. [2023-11-26 10:46:21,134 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2023-11-26 10:46:21,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 141 events. 1/141 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 159. Up to 7 conditions per place. [2023-11-26 10:46:21,136 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 8 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-11-26 10:46:21,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 80 transitions, 198 flow [2023-11-26 10:46:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-11-26 10:46:21,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.822463768115942 [2023-11-26 10:46:21,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-11-26 10:46:21,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-11-26 10:46:21,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:21,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-11-26 10:46:21,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 10:46:21,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 10:46:21,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 10:46:21,143 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 175 flow. Second operand 3 states and 227 transitions. [2023-11-26 10:46:21,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 80 transitions, 198 flow [2023-11-26 10:46:21,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:21,146 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 173 flow [2023-11-26 10:46:21,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2023-11-26 10:46:21,147 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -5 predicate places. [2023-11-26 10:46:21,148 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 173 flow [2023-11-26 10:46:21,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,149 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] [2023-11-26 10:46:21,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:46:21,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:46:21,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 466346869, now seen corresponding path program 1 times [2023-11-26 10:46:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72938993] [2023-11-26 10:46:21,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,207 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 10:46:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72938993] [2023-11-26 10:46:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72938993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:21,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689470112] [2023-11-26 10:46:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:21,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:21,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-26 10:46:21,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 10:46:21,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:21,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-26 10:46:21,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:21,268 INFO L124 PetriNetUnfolderBase]: 8/215 cut-off events. [2023-11-26 10:46:21,268 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2023-11-26 10:46:21,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 215 events. 8/215 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 780 event pairs, 4 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 259. Up to 25 conditions per place. [2023-11-26 10:46:21,270 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 12 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-11-26 10:46:21,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 214 flow [2023-11-26 10:46:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-26 10:46:21,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8152173913043478 [2023-11-26 10:46:21,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-26 10:46:21,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-26 10:46:21,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:21,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-26 10:46:21,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 10:46:21,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 10:46:21,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 10:46:21,278 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 173 flow. Second operand 3 states and 225 transitions. [2023-11-26 10:46:21,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 214 flow [2023-11-26 10:46:21,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:21,282 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 197 flow [2023-11-26 10:46:21,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2023-11-26 10:46:21,283 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-26 10:46:21,283 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 197 flow [2023-11-26 10:46:21,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 10:46:21,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,284 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:21,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:46:21,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:46:21,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash -432073854, now seen corresponding path program 1 times [2023-11-26 10:46:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:21,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309529960] [2023-11-26 10:46:21,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:21,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:46:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:21,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:46:21,360 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:46:21,361 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2023-11-26 10:46:21,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-11-26 10:46:21,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-11-26 10:46:21,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-11-26 10:46:21,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-11-26 10:46:21,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-11-26 10:46:21,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-11-26 10:46:21,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-11-26 10:46:21,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-11-26 10:46:21,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-11-26 10:46:21,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-11-26 10:46:21,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-11-26 10:46:21,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-11-26 10:46:21,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-11-26 10:46:21,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:46:21,368 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 10:46:21,371 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:46:21,372 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 10:46:21,421 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-26 10:46:21,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 113 transitions, 242 flow [2023-11-26 10:46:21,459 INFO L124 PetriNetUnfolderBase]: 22/237 cut-off events. [2023-11-26 10:46:21,459 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:46:21,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 237 events. 22/237 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 669 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-11-26 10:46:21,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 113 transitions, 242 flow [2023-11-26 10:46:21,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 113 transitions, 242 flow [2023-11-26 10:46:21,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:46:21,467 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;@7e092854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:46:21,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-26 10:46:21,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:46:21,470 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 10:46:21,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:21,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:21,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:46:21,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,472 INFO L85 PathProgramCache]: Analyzing trace with hash -216625716, now seen corresponding path program 1 times [2023-11-26 10:46:21,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:21,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618681681] [2023-11-26 10:46:21,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,493 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 10:46:21,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618681681] [2023-11-26 10:46:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618681681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546602308] [2023-11-26 10:46:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:21,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:46:21,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:21,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:46:21,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:46:21,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2023-11-26 10:46:21,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 113 transitions, 242 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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 10:46:21,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:21,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2023-11-26 10:46:21,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:21,549 INFO L124 PetriNetUnfolderBase]: 19/231 cut-off events. [2023-11-26 10:46:21,549 INFO L125 PetriNetUnfolderBase]: For 38/44 co-relation queries the response was YES. [2023-11-26 10:46:21,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 231 events. 19/231 cut-off events. For 38/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 781 event pairs, 4 based on Foata normal form. 26/227 useless extension candidates. Maximal degree in co-relation 136. Up to 30 conditions per place. [2023-11-26 10:46:21,552 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 11 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2023-11-26 10:46:21,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 99 transitions, 236 flow [2023-11-26 10:46:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:46:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:46:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-11-26 10:46:21,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8938053097345132 [2023-11-26 10:46:21,554 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-11-26 10:46:21,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-11-26 10:46:21,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:21,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-11-26 10:46:21,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 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 10:46:21,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 10:46:21,557 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 10:46:21,558 INFO L175 Difference]: Start difference. First operand has 108 places, 113 transitions, 242 flow. Second operand 2 states and 202 transitions. [2023-11-26 10:46:21,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 99 transitions, 236 flow [2023-11-26 10:46:21,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 99 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:46:21,561 INFO L231 Difference]: Finished difference. Result has 99 places, 99 transitions, 214 flow [2023-11-26 10:46:21,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=99} [2023-11-26 10:46:21,563 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -9 predicate places. [2023-11-26 10:46:21,563 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 99 transitions, 214 flow [2023-11-26 10:46:21,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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 10:46:21,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,564 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] [2023-11-26 10:46:21,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:46:21,564 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:46:21,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash -645241721, now seen corresponding path program 1 times [2023-11-26 10:46:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:21,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117413045] [2023-11-26 10:46:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,608 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 10:46:21,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117413045] [2023-11-26 10:46:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117413045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:21,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:46:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97505211] [2023-11-26 10:46:21,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:21,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:21,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-26 10:46:21,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 10:46:21,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:21,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-26 10:46:21,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:21,711 INFO L124 PetriNetUnfolderBase]: 59/445 cut-off events. [2023-11-26 10:46:21,711 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-26 10:46:21,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 445 events. 59/445 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2319 event pairs, 10 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 556. Up to 94 conditions per place. [2023-11-26 10:46:21,716 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 18 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-11-26 10:46:21,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 260 flow [2023-11-26 10:46:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-11-26 10:46:21,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053097345132744 [2023-11-26 10:46:21,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-11-26 10:46:21,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-11-26 10:46:21,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:21,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-11-26 10:46:21,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 10:46:21,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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 10:46:21,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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 10:46:21,723 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 214 flow. Second operand 3 states and 273 transitions. [2023-11-26 10:46:21,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 260 flow [2023-11-26 10:46:21,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:46:21,727 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 226 flow [2023-11-26 10:46:21,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2023-11-26 10:46:21,728 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2023-11-26 10:46:21,729 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 226 flow [2023-11-26 10:46:21,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 10:46:21,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,730 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] [2023-11-26 10:46:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:46:21,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:46:21,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash 688878998, now seen corresponding path program 1 times [2023-11-26 10:46:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:21,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469849559] [2023-11-26 10:46:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,765 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 10:46:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:21,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469849559] [2023-11-26 10:46:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469849559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:21,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:21,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231792917] [2023-11-26 10:46:21,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:21,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:21,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:21,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-26 10:46:21,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 10:46:21,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:21,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-26 10:46:21,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:21,943 INFO L124 PetriNetUnfolderBase]: 60/739 cut-off events. [2023-11-26 10:46:21,944 INFO L125 PetriNetUnfolderBase]: For 141/327 co-relation queries the response was YES. [2023-11-26 10:46:21,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 739 events. 60/739 cut-off events. For 141/327 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4838 event pairs, 11 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 901. Up to 59 conditions per place. [2023-11-26 10:46:21,950 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 22 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-11-26 10:46:21,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 111 transitions, 315 flow [2023-11-26 10:46:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-11-26 10:46:21,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.831858407079646 [2023-11-26 10:46:21,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-11-26 10:46:21,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-11-26 10:46:21,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:21,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-11-26 10:46:21,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 10:46:21,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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 10:46:21,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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 10:46:21,957 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 226 flow. Second operand 3 states and 282 transitions. [2023-11-26 10:46:21,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 111 transitions, 315 flow [2023-11-26 10:46:21,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 111 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:21,961 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 276 flow [2023-11-26 10:46:21,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=105, PETRI_TRANSITIONS=106} [2023-11-26 10:46:21,962 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2023-11-26 10:46:21,962 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 276 flow [2023-11-26 10:46:21,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 10:46:21,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,963 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] [2023-11-26 10:46:21,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:46:21,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:46:21,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1040897320, now seen corresponding path program 1 times [2023-11-26 10:46:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:21,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847301336] [2023-11-26 10:46:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,999 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 10:46:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847301336] [2023-11-26 10:46:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847301336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:22,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537648240] [2023-11-26 10:46:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:22,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:22,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:22,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-26 10:46:22,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 106 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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 10:46:22,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:22,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-26 10:46:22,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:22,315 INFO L124 PetriNetUnfolderBase]: 272/1930 cut-off events. [2023-11-26 10:46:22,315 INFO L125 PetriNetUnfolderBase]: For 420/866 co-relation queries the response was YES. [2023-11-26 10:46:22,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1930 events. 272/1930 cut-off events. For 420/866 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17298 event pairs, 91 based on Foata normal form. 1/1670 useless extension candidates. Maximal degree in co-relation 2711. Up to 395 conditions per place. [2023-11-26 10:46:22,331 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2023-11-26 10:46:22,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 391 flow [2023-11-26 10:46:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-11-26 10:46:22,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2023-11-26 10:46:22,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-11-26 10:46:22,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-11-26 10:46:22,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:22,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-11-26 10:46:22,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 10:46:22,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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 10:46:22,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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 10:46:22,338 INFO L175 Difference]: Start difference. First operand has 105 places, 106 transitions, 276 flow. Second operand 3 states and 279 transitions. [2023-11-26 10:46:22,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 391 flow [2023-11-26 10:46:22,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:22,344 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 334 flow [2023-11-26 10:46:22,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=107, PETRI_TRANSITIONS=114} [2023-11-26 10:46:22,345 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2023-11-26 10:46:22,345 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 334 flow [2023-11-26 10:46:22,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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 10:46:22,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:22,346 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] [2023-11-26 10:46:22,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:46:22,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:46:22,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:22,347 INFO L85 PathProgramCache]: Analyzing trace with hash -457973571, now seen corresponding path program 1 times [2023-11-26 10:46:22,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:22,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177824847] [2023-11-26 10:46:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:22,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177824847] [2023-11-26 10:46:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177824847] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:46:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992082772] [2023-11-26 10:46:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:22,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:46:22,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:46:22,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:46:22,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:46:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:22,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:46:22,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:22,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:46:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992082772] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:46:22,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:46:22,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 10:46:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062622382] [2023-11-26 10:46:22,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:46:22,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:46:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:22,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:46:22,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:46:22,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-26 10:46:22,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 114 transitions, 334 flow. Second operand has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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 10:46:22,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:22,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-26 10:46:22,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:23,040 INFO L124 PetriNetUnfolderBase]: 165/615 cut-off events. [2023-11-26 10:46:23,040 INFO L125 PetriNetUnfolderBase]: For 368/420 co-relation queries the response was YES. [2023-11-26 10:46:23,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 615 events. 165/615 cut-off events. For 368/420 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4273 event pairs, 5 based on Foata normal form. 37/600 useless extension candidates. Maximal degree in co-relation 1229. Up to 104 conditions per place. [2023-11-26 10:46:23,047 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 47 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2023-11-26 10:46:23,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 494 flow [2023-11-26 10:46:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:46:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:46:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 769 transitions. [2023-11-26 10:46:23,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561455260570304 [2023-11-26 10:46:23,052 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 769 transitions. [2023-11-26 10:46:23,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 769 transitions. [2023-11-26 10:46:23,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:23,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 769 transitions. [2023-11-26 10:46:23,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.44444444444444) internal successors, (769), 9 states have internal predecessors, (769), 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 10:46:23,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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 10:46:23,059 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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 10:46:23,059 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 334 flow. Second operand 9 states and 769 transitions. [2023-11-26 10:46:23,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 494 flow [2023-11-26 10:46:23,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:23,067 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 246 flow [2023-11-26 10:46:23,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-26 10:46:23,069 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -27 predicate places. [2023-11-26 10:46:23,069 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 246 flow [2023-11-26 10:46:23,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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 10:46:23,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:23,071 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:23,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:23,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-26 10:46:23,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:46:23,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1772929582, now seen corresponding path program 1 times [2023-11-26 10:46:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371535688] [2023-11-26 10:46:23,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:23,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:46:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:23,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:46:23,329 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:46:23,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-26 10:46:23,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-11-26 10:46:23,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-11-26 10:46:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-11-26 10:46:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-11-26 10:46:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-11-26 10:46:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-11-26 10:46:23,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-11-26 10:46:23,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-11-26 10:46:23,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-11-26 10:46:23,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-11-26 10:46:23,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-11-26 10:46:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-11-26 10:46:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-11-26 10:46:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-11-26 10:46:23,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-11-26 10:46:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-11-26 10:46:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-11-26 10:46:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:46:23,333 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 10:46:23,334 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:46:23,334 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 10:46:23,377 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 10:46:23,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 134 transitions, 295 flow [2023-11-26 10:46:23,442 INFO L124 PetriNetUnfolderBase]: 42/418 cut-off events. [2023-11-26 10:46:23,443 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-26 10:46:23,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 418 events. 42/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1425 event pairs, 1 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 245. Up to 16 conditions per place. [2023-11-26 10:46:23,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 134 transitions, 295 flow [2023-11-26 10:46:23,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 134 transitions, 295 flow [2023-11-26 10:46:23,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:46:23,454 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;@7e092854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:46:23,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-26 10:46:23,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:46:23,456 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 10:46:23,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:23,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:23,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:23,457 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:23,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1902783540, now seen corresponding path program 1 times [2023-11-26 10:46:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:23,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268380568] [2023-11-26 10:46:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:23,475 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 10:46:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268380568] [2023-11-26 10:46:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268380568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:23,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:23,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374876835] [2023-11-26 10:46:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:23,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:46:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:23,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:46:23,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:46:23,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2023-11-26 10:46:23,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 134 transitions, 295 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 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 10:46:23,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:23,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2023-11-26 10:46:23,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:23,595 INFO L124 PetriNetUnfolderBase]: 91/514 cut-off events. [2023-11-26 10:46:23,595 INFO L125 PetriNetUnfolderBase]: For 181/201 co-relation queries the response was YES. [2023-11-26 10:46:23,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 514 events. 91/514 cut-off events. For 181/201 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2378 event pairs, 27 based on Foata normal form. 72/523 useless extension candidates. Maximal degree in co-relation 362. Up to 122 conditions per place. [2023-11-26 10:46:23,601 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 15 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-11-26 10:46:23,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 118 transitions, 293 flow [2023-11-26 10:46:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:46:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:46:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-11-26 10:46:23,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2023-11-26 10:46:23,604 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-11-26 10:46:23,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-11-26 10:46:23,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:23,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-11-26 10:46:23,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 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 10:46:23,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 10:46:23,608 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 10:46:23,608 INFO L175 Difference]: Start difference. First operand has 128 places, 134 transitions, 295 flow. Second operand 2 states and 238 transitions. [2023-11-26 10:46:23,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 118 transitions, 293 flow [2023-11-26 10:46:23,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:46:23,611 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 263 flow [2023-11-26 10:46:23,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=263, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2023-11-26 10:46:23,613 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -11 predicate places. [2023-11-26 10:46:23,614 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 263 flow [2023-11-26 10:46:23,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 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 10:46:23,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:23,615 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] [2023-11-26 10:46:23,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:46:23,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:23,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649479, now seen corresponding path program 1 times [2023-11-26 10:46:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:23,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997206143] [2023-11-26 10:46:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:23,666 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 10:46:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997206143] [2023-11-26 10:46:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997206143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:46:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213969561] [2023-11-26 10:46:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:23,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:23,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:23,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 134 [2023-11-26 10:46:23,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 10:46:23,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:23,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 134 [2023-11-26 10:46:23,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:23,902 INFO L124 PetriNetUnfolderBase]: 234/1288 cut-off events. [2023-11-26 10:46:23,902 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-26 10:46:23,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 1288 events. 234/1288 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9034 event pairs, 64 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 1667. Up to 325 conditions per place. [2023-11-26 10:46:23,919 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 22 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2023-11-26 10:46:23,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 317 flow [2023-11-26 10:46:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-26 10:46:23,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8009950248756219 [2023-11-26 10:46:23,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-26 10:46:23,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-26 10:46:23,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:23,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-26 10:46:23,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 10:46:23,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:46:23,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:46:23,925 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 263 flow. Second operand 3 states and 322 transitions. [2023-11-26 10:46:23,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 317 flow [2023-11-26 10:46:23,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:46:23,929 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 275 flow [2023-11-26 10:46:23,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2023-11-26 10:46:23,930 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -8 predicate places. [2023-11-26 10:46:23,931 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 275 flow [2023-11-26 10:46:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 10:46:23,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:23,931 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] [2023-11-26 10:46:23,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:46:23,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:23,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1307333937, now seen corresponding path program 1 times [2023-11-26 10:46:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106754460] [2023-11-26 10:46:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:23,960 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 10:46:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106754460] [2023-11-26 10:46:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106754460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:23,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:23,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055438691] [2023-11-26 10:46:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:23,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-26 10:46:23,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:23,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-26 10:46:23,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:24,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, 89#L721-1true, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 10:46:24,635 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 10:46:24,635 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-26 10:46:24,635 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:46:24,635 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 10:46:24,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 96#L721-2true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 10:46:24,635 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:46:24,635 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 10:46:24,635 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:24,636 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-26 10:46:24,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 10:46:24,680 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:46:24,680 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:24,680 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:46:24,680 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:24,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][120], [salethreadThread3of3ForFork0NotInUse, 139#true, 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 10:46:24,734 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:46:24,734 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:24,734 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:24,734 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:46:24,765 INFO L124 PetriNetUnfolderBase]: 724/4772 cut-off events. [2023-11-26 10:46:24,765 INFO L125 PetriNetUnfolderBase]: For 1376/3596 co-relation queries the response was YES. [2023-11-26 10:46:24,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 4772 events. 724/4772 cut-off events. For 1376/3596 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 51849 event pairs, 153 based on Foata normal form. 9/3960 useless extension candidates. Maximal degree in co-relation 6283. Up to 584 conditions per place. [2023-11-26 10:46:24,818 INFO L140 encePairwiseOnDemand]: 122/134 looper letters, 32 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2023-11-26 10:46:24,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 136 transitions, 412 flow [2023-11-26 10:46:24,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-26 10:46:24,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8258706467661692 [2023-11-26 10:46:24,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-26 10:46:24,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-26 10:46:24,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:24,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-26 10:46:24,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 10:46:24,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:46:24,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:46:24,823 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 275 flow. Second operand 3 states and 332 transitions. [2023-11-26 10:46:24,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 136 transitions, 412 flow [2023-11-26 10:46:24,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:24,828 INFO L231 Difference]: Finished difference. Result has 123 places, 128 transitions, 351 flow [2023-11-26 10:46:24,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=123, PETRI_TRANSITIONS=128} [2023-11-26 10:46:24,829 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2023-11-26 10:46:24,829 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 351 flow [2023-11-26 10:46:24,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:24,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:24,830 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] [2023-11-26 10:46:24,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:46:24,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:24,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -21298053, now seen corresponding path program 1 times [2023-11-26 10:46:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:24,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136915593] [2023-11-26 10:46:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:24,858 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 10:46:24,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:24,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136915593] [2023-11-26 10:46:24,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136915593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:24,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:24,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:24,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213901751] [2023-11-26 10:46:24,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:24,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:24,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:24,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:24,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 134 [2023-11-26 10:46:24,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 10:46:24,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:24,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 134 [2023-11-26 10:46:24,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:27,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,235 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 10:46:27,235 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:46:27,235 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:46:27,236 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:46:27,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,236 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 10:46:27,236 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:46:27,236 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:46:27,236 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-26 10:46:27,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,237 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,237 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:27,237 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,237 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:46:27,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][81], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,238 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,238 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:46:27,238 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:27,238 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,278 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-26 10:46:27,278 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:46:27,278 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:46:27,278 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:46:27,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 131#true, 50#L752-1true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,298 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 10:46:27,298 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-26 10:46:27,298 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-26 10:46:27,298 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-26 10:46:27,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 10:46:27,438 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,438 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:46:27,438 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:27,438 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 10:46:27,439 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,439 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:27,440 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:46:27,440 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, salethreadThread1of3ForFork0InUse, 94#L722-2true, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,450 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 10:46:27,450 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:46:27,451 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:46:27,451 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:46:27,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L724-->L730: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{~stopSales~0=v_~stopSales~0_20, salethreadThread1of3ForFork0_#t~nondet1=|v_salethreadThread1of3ForFork0_#t~nondet1_3|, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread1of3ForFork0_#t~nondet1][47], [salethreadThread3of3ForFork0NotInUse, Black: 141#(= |#race~stopSales~0| 0), 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, 108#L721-2true, 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,452 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-26 10:46:27,452 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:46:27,452 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:46:27,452 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:46:27,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,462 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 10:46:27,462 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:46:27,463 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:46:27,463 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:46:27,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, 94#L722-2true, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,538 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-26 10:46:27,538 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:46:27,538 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:46:27,538 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:46:27,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L724-->L730: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{~stopSales~0=v_~stopSales~0_20, salethreadThread1of3ForFork0_#t~nondet1=|v_salethreadThread1of3ForFork0_#t~nondet1_3|, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread1of3ForFork0_#t~nondet1][47], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, 108#L721-2true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,539 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 10:46:27,539 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 10:46:27,539 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:46:27,539 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:46:27,591 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,591 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 10:46:27,592 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:46:27,592 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:46:27,592 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-26 10:46:27,592 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:46:27,679 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,679 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 10:46:27,680 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:46:27,680 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:46:27,680 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:46:27,680 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:46:27,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,708 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,709 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 10:46:27,709 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-26 10:46:27,709 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 10:46:27,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,778 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 10:46:27,778 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:46:27,778 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-26 10:46:27,778 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:46:27,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 28#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 10:46:27,782 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 10:46:27,782 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:46:27,783 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-26 10:46:27,783 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:46:27,790 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 10:46:27,790 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,790 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:46:27,790 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:46:27,790 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,791 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 10:46:27,798 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 10:46:27,798 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:46:27,799 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:46:27,799 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:46:27,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][142], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,813 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 10:46:27,813 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:46:27,813 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:46:27,813 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:46:27,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][143], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,838 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,838 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,838 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:27,838 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:27,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true, 94#L722-2true]) [2023-11-26 10:46:27,860 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 10:46:27,860 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:46:27,861 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:46:27,861 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:46:27,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][142], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:27,882 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 10:46:27,882 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:46:27,882 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:46:27,882 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:46:28,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 10:46:28,223 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-26 10:46:28,223 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 10:46:28,223 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:46:28,223 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-26 10:46:28,239 INFO L124 PetriNetUnfolderBase]: 4754/19531 cut-off events. [2023-11-26 10:46:28,239 INFO L125 PetriNetUnfolderBase]: For 6179/14413 co-relation queries the response was YES. [2023-11-26 10:46:28,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30730 conditions, 19531 events. 4754/19531 cut-off events. For 6179/14413 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 255010 event pairs, 1453 based on Foata normal form. 28/16746 useless extension candidates. Maximal degree in co-relation 30721. Up to 5204 conditions per place. [2023-11-26 10:46:28,438 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 41 selfloop transitions, 11 changer transitions 0/150 dead transitions. [2023-11-26 10:46:28,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 150 transitions, 538 flow [2023-11-26 10:46:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-26 10:46:28,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.818407960199005 [2023-11-26 10:46:28,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-26 10:46:28,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-26 10:46:28,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:28,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-26 10:46:28,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 10:46:28,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:46:28,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:46:28,445 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 351 flow. Second operand 3 states and 329 transitions. [2023-11-26 10:46:28,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 150 transitions, 538 flow [2023-11-26 10:46:28,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 150 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:28,466 INFO L231 Difference]: Finished difference. Result has 125 places, 139 transitions, 429 flow [2023-11-26 10:46:28,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=125, PETRI_TRANSITIONS=139} [2023-11-26 10:46:28,467 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2023-11-26 10:46:28,467 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 429 flow [2023-11-26 10:46:28,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 10:46:28,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:28,468 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] [2023-11-26 10:46:28,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:46:28,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:28,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1810559632, now seen corresponding path program 1 times [2023-11-26 10:46:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:28,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104342459] [2023-11-26 10:46:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:28,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104342459] [2023-11-26 10:46:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104342459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:46:28,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815019867] [2023-11-26 10:46:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:28,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:46:28,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:46:28,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:46:28,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:46:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:28,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:46:28,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:28,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:46:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815019867] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:46:28,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:46:28,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 10:46:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202787323] [2023-11-26 10:46:28,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:46:28,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:46:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:46:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:46:28,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-26 10:46:28,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 139 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 98.4) internal successors, (984), 10 states have internal predecessors, (984), 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 10:46:28,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:28,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-26 10:46:28,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:33,047 INFO L124 PetriNetUnfolderBase]: 6843/29541 cut-off events. [2023-11-26 10:46:33,047 INFO L125 PetriNetUnfolderBase]: For 11830/14504 co-relation queries the response was YES. [2023-11-26 10:46:33,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50263 conditions, 29541 events. 6843/29541 cut-off events. For 11830/14504 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 413558 event pairs, 1394 based on Foata normal form. 159/25410 useless extension candidates. Maximal degree in co-relation 50253. Up to 5597 conditions per place. [2023-11-26 10:46:33,319 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 72 selfloop transitions, 9 changer transitions 0/189 dead transitions. [2023-11-26 10:46:33,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 189 transitions, 801 flow [2023-11-26 10:46:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:46:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:46:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2023-11-26 10:46:33,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7653399668325042 [2023-11-26 10:46:33,325 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2023-11-26 10:46:33,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2023-11-26 10:46:33,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:33,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2023-11-26 10:46:33,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 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 10:46:33,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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 10:46:33,335 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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 10:46:33,335 INFO L175 Difference]: Start difference. First operand has 125 places, 139 transitions, 429 flow. Second operand 9 states and 923 transitions. [2023-11-26 10:46:33,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 189 transitions, 801 flow [2023-11-26 10:46:33,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:33,441 INFO L231 Difference]: Finished difference. Result has 134 places, 145 transitions, 457 flow [2023-11-26 10:46:33,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=457, PETRI_PLACES=134, PETRI_TRANSITIONS=145} [2023-11-26 10:46:33,442 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2023-11-26 10:46:33,442 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 145 transitions, 457 flow [2023-11-26 10:46:33,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.4) internal successors, (984), 10 states have internal predecessors, (984), 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 10:46:33,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:33,443 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:33,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:33,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-26 10:46:33,650 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:33,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1744744612, now seen corresponding path program 1 times [2023-11-26 10:46:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988372087] [2023-11-26 10:46:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 10:46:33,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988372087] [2023-11-26 10:46:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988372087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:33,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:33,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518464941] [2023-11-26 10:46:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:33,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:46:33,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:46:33,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:46:33,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-26 10:46:33,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 145 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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 10:46:33,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:33,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-26 10:46:33,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:37,244 INFO L124 PetriNetUnfolderBase]: 5075/27838 cut-off events. [2023-11-26 10:46:37,244 INFO L125 PetriNetUnfolderBase]: For 5599/9439 co-relation queries the response was YES. [2023-11-26 10:46:37,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41170 conditions, 27838 events. 5075/27838 cut-off events. For 5599/9439 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 412368 event pairs, 1263 based on Foata normal form. 290/24503 useless extension candidates. Maximal degree in co-relation 41158. Up to 4173 conditions per place. [2023-11-26 10:46:37,607 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 55 selfloop transitions, 8 changer transitions 0/183 dead transitions. [2023-11-26 10:46:37,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 183 transitions, 762 flow [2023-11-26 10:46:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:46:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:46:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-11-26 10:46:37,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2023-11-26 10:46:37,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-11-26 10:46:37,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-11-26 10:46:37,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:37,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-11-26 10:46:37,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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 10:46:37,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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 10:46:37,620 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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 10:46:37,621 INFO L175 Difference]: Start difference. First operand has 134 places, 145 transitions, 457 flow. Second operand 5 states and 555 transitions. [2023-11-26 10:46:37,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 183 transitions, 762 flow [2023-11-26 10:46:37,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 183 transitions, 756 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:37,631 INFO L231 Difference]: Finished difference. Result has 140 places, 152 transitions, 521 flow [2023-11-26 10:46:37,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=521, PETRI_PLACES=140, PETRI_TRANSITIONS=152} [2023-11-26 10:46:37,633 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 12 predicate places. [2023-11-26 10:46:37,634 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 152 transitions, 521 flow [2023-11-26 10:46:37,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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 10:46:37,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:37,635 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:37,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:46:37,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:37,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -547111440, now seen corresponding path program 1 times [2023-11-26 10:46:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:37,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329312345] [2023-11-26 10:46:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:37,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 10:46:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:37,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329312345] [2023-11-26 10:46:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329312345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:37,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196448377] [2023-11-26 10:46:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:37,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:46:37,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:46:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:46:37,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-26 10:46:37,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 152 transitions, 521 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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 10:46:37,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:37,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-26 10:46:37,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:40,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][177], [salethreadThread3of3ForFork0NotInUse, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 414#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:40,706 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:46:40,706 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:40,706 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:40,706 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:41,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][168], [salethreadThread3of3ForFork0NotInUse, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 414#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:41,110 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:46:41,110 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:41,110 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:46:41,110 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:46:41,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][144], [salethreadThread3of3ForFork0NotInUse, 411#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 116#L721-4true, Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:41,160 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-26 10:46:41,160 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:46:41,160 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 10:46:41,160 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 10:46:41,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][140], [salethreadThread3of3ForFork0NotInUse, 411#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 5), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 116#L721-4true, Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 10:46:41,189 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-26 10:46:41,189 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:46:41,189 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 10:46:41,189 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:46:41,829 INFO L124 PetriNetUnfolderBase]: 5072/28011 cut-off events. [2023-11-26 10:46:41,829 INFO L125 PetriNetUnfolderBase]: For 11635/15435 co-relation queries the response was YES. [2023-11-26 10:46:42,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44769 conditions, 28011 events. 5072/28011 cut-off events. For 11635/15435 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 416856 event pairs, 1316 based on Foata normal form. 432/24897 useless extension candidates. Maximal degree in co-relation 44753. Up to 3862 conditions per place. [2023-11-26 10:46:42,112 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 47 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2023-11-26 10:46:42,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 180 transitions, 791 flow [2023-11-26 10:46:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:46:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:46:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-11-26 10:46:42,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8223880597014925 [2023-11-26 10:46:42,117 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-11-26 10:46:42,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-11-26 10:46:42,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:42,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-11-26 10:46:42,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 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 10:46:42,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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 10:46:42,123 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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 10:46:42,123 INFO L175 Difference]: Start difference. First operand has 140 places, 152 transitions, 521 flow. Second operand 5 states and 551 transitions. [2023-11-26 10:46:42,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 180 transitions, 791 flow [2023-11-26 10:46:42,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 180 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:42,139 INFO L231 Difference]: Finished difference. Result has 146 places, 157 transitions, 590 flow [2023-11-26 10:46:42,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=590, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2023-11-26 10:46:42,140 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 18 predicate places. [2023-11-26 10:46:42,141 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 590 flow [2023-11-26 10:46:42,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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 10:46:42,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:42,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:42,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:46:42,142 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:46:42,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 758635425, now seen corresponding path program 1 times [2023-11-26 10:46:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:42,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518486662] [2023-11-26 10:46:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:42,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:46:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:42,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:46:42,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:46:42,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2023-11-26 10:46:42,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-26 10:46:42,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-26 10:46:42,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-26 10:46:42,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-26 10:46:42,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-26 10:46:42,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-26 10:46:42,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-26 10:46:42,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-26 10:46:42,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-26 10:46:42,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2023-11-26 10:46:42,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-26 10:46:42,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-26 10:46:42,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-26 10:46:42,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-26 10:46:42,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-26 10:46:42,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-26 10:46:42,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-26 10:46:42,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-26 10:46:42,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-26 10:46:42,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-26 10:46:42,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-26 10:46:42,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:46:42,217 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:42,225 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-26 10:46:42,225 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:46:42,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:42,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:42,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:46:42 BasicIcfg [2023-11-26 10:46:42,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:46:42,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:46:42,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:46:42,337 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:46:42,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:20" (3/4) ... [2023-11-26 10:46:42,340 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:46:42,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:46:42,342 INFO L158 Benchmark]: Toolchain (without parser) took 23697.83ms. Allocated memory was 178.3MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 131.7MB in the beginning and 5.1GB in the end (delta: -4.9GB). Peak memory consumption was 725.3MB. Max. memory is 16.1GB. [2023-11-26 10:46:42,343 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory was 93.1MB in the beginning and 93.1MB in the end (delta: 34.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:42,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.00ms. Allocated memory is still 178.3MB. Free memory was 131.7MB in the beginning and 111.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-26 10:46:42,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.72ms. Allocated memory is still 178.3MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:42,344 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:42,344 INFO L158 Benchmark]: RCFGBuilder took 664.78ms. Allocated memory is still 178.3MB. Free memory was 107.3MB in the beginning and 90.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 10:46:42,345 INFO L158 Benchmark]: TraceAbstraction took 22261.90ms. Allocated memory was 178.3MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 89.7MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 683.3MB. Max. memory is 16.1GB. [2023-11-26 10:46:42,345 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 5.8GB. Free memory is still 5.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:42,350 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory was 93.1MB in the beginning and 93.1MB in the end (delta: 34.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.00ms. Allocated memory is still 178.3MB. Free memory was 131.7MB in the beginning and 111.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.72ms. Allocated memory is still 178.3MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 664.78ms. Allocated memory is still 178.3MB. Free memory was 107.3MB in the beginning and 90.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22261.90ms. Allocated memory was 178.3MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 89.7MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 683.3MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 5.8GB. Free memory is still 5.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected [2023-11-26 10:46:42,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:42,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:42,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:42,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[5]; VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=0, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 5 VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=49, argc=49, argv={52:50}, i=0, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, argc=49, argv={52:50}, i=0, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={52:50}, i=0, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={52:50}, i=1, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={52:50}, i=1, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={52:50}, i=1, numOfTickets=5, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (5 - (((5 / 10) == 0) ? 1 : (5 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=5, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 104 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 11 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 122 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 19 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 2 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 140 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.8s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 31 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 479 SizeOfPredicates, 2 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 10:46:42,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f85d3711-937c-430e-acbc-f8bee7d9861a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE