./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 cb0da49952f084f4179c44b957c91689c392bf769782a6b0853667237fdff1db --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:57:07,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:57:07,744 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-06 21:57:07,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:57:07,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:57:07,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:57:07,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:57:07,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:57:07,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:57:07,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:57:07,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:57:07,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:57:07,814 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:57:07,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:57:07,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:57:07,817 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:57:07,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:57:07,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:57:07,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:57:07,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:57:07,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:57:07,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:57:07,820 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-06 21:57:07,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:57:07,821 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:57:07,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:57:07,821 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:57:07,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:57:07,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:57:07,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:57:07,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:57:07,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:57:07,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:57:07,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:57:07,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:57:07,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:57:07,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:57:07,827 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:57:07,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:57:07,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:57:07,827 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:57:07,846 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_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/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_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> cb0da49952f084f4179c44b957c91689c392bf769782a6b0853667237fdff1db [2023-11-06 21:57:08,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:57:08,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:57:08,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:57:08,230 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:57:08,230 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:57:08,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2023-11-06 21:57:11,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:57:11,606 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:57:11,607 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2023-11-06 21:57:11,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/data/4cb6d3651/b044d005ae1a43139c5a2f8137d461f1/FLAG9b5f8572a [2023-11-06 21:57:11,638 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/data/4cb6d3651/b044d005ae1a43139c5a2f8137d461f1 [2023-11-06 21:57:11,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:57:11,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:57:11,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:57:11,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:57:11,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:57:11,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:57:11" (1/1) ... [2023-11-06 21:57:11,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675068e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:11, skipping insertion in model container [2023-11-06 21:57:11,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:57:11" (1/1) ... [2023-11-06 21:57:11,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:57:12,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:57:12,197 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:57:12,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:57:12,315 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:57:12,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12 WrapperNode [2023-11-06 21:57:12,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:57:12,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:57:12,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:57:12,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:57:12,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,390 INFO L138 Inliner]: procedures = 166, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-11-06 21:57:12,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:57:12,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:57:12,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:57:12,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:57:12,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:57:12,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:57:12,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:57:12,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:57:12,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:57:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:57:12,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:57:12,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0da45a7-8e5b-42ac-a72b-0fe9d94a4122/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:57:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-06 21:57:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-06 21:57:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:57:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:57:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:57:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:57:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:57:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:57:12,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:57:12,581 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:57:12,716 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:57:12,718 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:57:12,869 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:57:12,877 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:57:12,877 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:57:12,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:12 BoogieIcfgContainer [2023-11-06 21:57:12,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:57:12,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:57:12,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:57:12,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:57:12,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:57:11" (1/3) ... [2023-11-06 21:57:12,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1013f04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:57:12, skipping insertion in model container [2023-11-06 21:57:12,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (2/3) ... [2023-11-06 21:57:12,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1013f04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:57:12, skipping insertion in model container [2023-11-06 21:57:12,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:12" (3/3) ... [2023-11-06 21:57:12,890 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs-b.i [2023-11-06 21:57:12,899 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 21:57:12,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:57:12,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-06 21:57:12,911 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:57:12,961 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:57:13,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 134 flow [2023-11-06 21:57:13,040 INFO L124 PetriNetUnfolderBase]: 5/76 cut-off events. [2023-11-06 21:57:13,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:57:13,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 5/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2023-11-06 21:57:13,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 65 transitions, 134 flow [2023-11-06 21:57:13,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 65 transitions, 134 flow [2023-11-06 21:57:13,055 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:57:13,070 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 65 transitions, 134 flow [2023-11-06 21:57:13,073 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 134 flow [2023-11-06 21:57:13,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 134 flow [2023-11-06 21:57:13,108 INFO L124 PetriNetUnfolderBase]: 5/76 cut-off events. [2023-11-06 21:57:13,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:57:13,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 5/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2023-11-06 21:57:13,118 INFO L119 LiptonReduction]: Number of co-enabled transitions 1092 [2023-11-06 21:57:15,612 INFO L134 LiptonReduction]: Checked pairs total: 852 [2023-11-06 21:57:15,612 INFO L136 LiptonReduction]: Total number of compositions: 71 [2023-11-06 21:57:15,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:57:15,651 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=LoopsAndPotentialCycles, 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;@39fb7332, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:57:15,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-06 21:57:15,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:57:15,657 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-06 21:57:15,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:57:15,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:15,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 21:57:15,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-06 21:57:15,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash 8716690, now seen corresponding path program 1 times [2023-11-06 21:57:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:15,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466346808] [2023-11-06 21:57:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:15,881 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-06 21:57:15,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466346808] [2023-11-06 21:57:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466346808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:15,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:57:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363185289] [2023-11-06 21:57:15,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:15,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:57:15,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:15,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:57:15,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:57:15,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 136 [2023-11-06 21:57:15,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 28 flow. Second operand has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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-06 21:57:15,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:15,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 136 [2023-11-06 21:57:15,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:15,968 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-11-06 21:57:15,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:57:15,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2023-11-06 21:57:15,970 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2023-11-06 21:57:15,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 26 flow [2023-11-06 21:57:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:57:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:57:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 129 transitions. [2023-11-06 21:57:15,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742647058823529 [2023-11-06 21:57:15,988 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 129 transitions. [2023-11-06 21:57:15,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 129 transitions. [2023-11-06 21:57:15,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:15,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 129 transitions. [2023-11-06 21:57:16,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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-06 21:57:16,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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-06 21:57:16,008 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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-06 21:57:16,010 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 2 states and 129 transitions. [2023-11-06 21:57:16,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 26 flow [2023-11-06 21:57:16,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 26 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:57:16,015 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 16 flow [2023-11-06 21:57:16,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=16, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2023-11-06 21:57:16,022 INFO L281 CegarLoopForPetriNet]: 15 programPoint places, -5 predicate places. [2023-11-06 21:57:16,022 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 16 flow [2023-11-06 21:57:16,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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-06 21:57:16,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:16,023 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-06 21:57:16,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:57:16,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-06 21:57:16,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash -213205510, now seen corresponding path program 1 times [2023-11-06 21:57:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:16,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64033040] [2023-11-06 21:57:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:16,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:57:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:16,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:57:16,140 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:57:16,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-06 21:57:16,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-06 21:57:16,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-06 21:57:16,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-06 21:57:16,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-06 21:57:16,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-06 21:57:16,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-06 21:57:16,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-06 21:57:16,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-06 21:57:16,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-06 21:57:16,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-06 21:57:16,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:57:16,148 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 21:57:16,151 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 21:57:16,151 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-06 21:57:16,173 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:57:16,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 105 transitions, 220 flow [2023-11-06 21:57:16,252 INFO L124 PetriNetUnfolderBase]: 9/129 cut-off events. [2023-11-06 21:57:16,285 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 21:57:16,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 129 events. 9/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 335 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 91. Up to 6 conditions per place. [2023-11-06 21:57:16,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 105 transitions, 220 flow [2023-11-06 21:57:16,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 105 transitions, 220 flow [2023-11-06 21:57:16,290 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:57:16,290 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 105 transitions, 220 flow [2023-11-06 21:57:16,291 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 105 transitions, 220 flow [2023-11-06 21:57:16,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 105 transitions, 220 flow [2023-11-06 21:57:16,333 INFO L124 PetriNetUnfolderBase]: 9/129 cut-off events. [2023-11-06 21:57:16,343 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 21:57:16,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 129 events. 9/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 335 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 91. Up to 6 conditions per place. [2023-11-06 21:57:16,351 INFO L119 LiptonReduction]: Number of co-enabled transitions 5304 [2023-11-06 21:57:17,401 INFO L134 LiptonReduction]: Checked pairs total: 14909 [2023-11-06 21:57:17,401 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-11-06 21:57:17,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:57:17,417 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=LoopsAndPotentialCycles, 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;@39fb7332, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:57:17,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 21:57:17,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:57:17,421 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-06 21:57:17,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:57:17,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:17,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 21:57:17,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-06 21:57:17,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 480307642, now seen corresponding path program 1 times [2023-11-06 21:57:17,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376923943] [2023-11-06 21:57:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,518 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-06 21:57:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376923943] [2023-11-06 21:57:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376923943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:17,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287249676] [2023-11-06 21:57:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:17,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:17,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 175 [2023-11-06 21:57:17,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-06 21:57:17,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:17,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 175 [2023-11-06 21:57:17,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:17,755 INFO L124 PetriNetUnfolderBase]: 403/959 cut-off events. [2023-11-06 21:57:17,755 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 21:57:17,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 959 events. 403/959 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6269 event pairs, 156 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 1344. Up to 485 conditions per place. [2023-11-06 21:57:17,768 INFO L140 encePairwiseOnDemand]: 166/175 looper letters, 40 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2023-11-06 21:57:17,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 243 flow [2023-11-06 21:57:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-06 21:57:17,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5923809523809523 [2023-11-06 21:57:17,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-06 21:57:17,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-06 21:57:17,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:17,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-06 21:57:17,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-06 21:57:17,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 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-06 21:57:17,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 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-06 21:57:17,786 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 106 flow. Second operand 3 states and 311 transitions. [2023-11-06 21:57:17,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 243 flow [2023-11-06 21:57:17,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:57:17,791 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 156 flow [2023-11-06 21:57:17,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-11-06 21:57:17,792 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-11-06 21:57:17,793 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 156 flow [2023-11-06 21:57:17,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-06 21:57:17,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:17,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:17,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:57:17,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-06 21:57:17,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1985667915, now seen corresponding path program 1 times [2023-11-06 21:57:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642888212] [2023-11-06 21:57:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,860 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-06 21:57:17,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:17,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642888212] [2023-11-06 21:57:17,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642888212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:17,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:17,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:17,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716678565] [2023-11-06 21:57:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:17,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:17,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 175 [2023-11-06 21:57:17,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 156 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-06 21:57:17,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:17,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 175 [2023-11-06 21:57:17,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:18,120 INFO L124 PetriNetUnfolderBase]: 638/1377 cut-off events. [2023-11-06 21:57:18,120 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2023-11-06 21:57:18,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2752 conditions, 1377 events. 638/1377 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9513 event pairs, 278 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 1544. Up to 573 conditions per place. [2023-11-06 21:57:18,133 INFO L140 encePairwiseOnDemand]: 161/175 looper letters, 45 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2023-11-06 21:57:18,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 325 flow [2023-11-06 21:57:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-11-06 21:57:18,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5695238095238095 [2023-11-06 21:57:18,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-11-06 21:57:18,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-11-06 21:57:18,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:18,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-11-06 21:57:18,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:57:18,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 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-06 21:57:18,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 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-06 21:57:18,140 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 156 flow. Second operand 3 states and 299 transitions. [2023-11-06 21:57:18,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 325 flow [2023-11-06 21:57:18,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:57:18,149 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 232 flow [2023-11-06 21:57:18,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2023-11-06 21:57:18,152 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-11-06 21:57:18,152 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 232 flow [2023-11-06 21:57:18,152 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-06 21:57:18,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:18,153 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-06 21:57:18,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:57:18,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-06 21:57:18,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1171943236, now seen corresponding path program 1 times [2023-11-06 21:57:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:18,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058311034] [2023-11-06 21:57:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:18,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:57:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:18,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:57:18,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:57:18,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-11-06 21:57:18,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2023-11-06 21:57:18,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2023-11-06 21:57:18,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2023-11-06 21:57:18,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2023-11-06 21:57:18,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2023-11-06 21:57:18,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2023-11-06 21:57:18,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2023-11-06 21:57:18,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2023-11-06 21:57:18,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2023-11-06 21:57:18,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2023-11-06 21:57:18,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2023-11-06 21:57:18,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2023-11-06 21:57:18,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2023-11-06 21:57:18,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2023-11-06 21:57:18,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2023-11-06 21:57:18,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:57:18,225 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 21:57:18,226 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 21:57:18,226 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-06 21:57:18,259 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:57:18,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 145 transitions, 308 flow [2023-11-06 21:57:18,305 INFO L124 PetriNetUnfolderBase]: 13/182 cut-off events. [2023-11-06 21:57:18,305 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 21:57:18,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 182 events. 13/182 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 567 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-11-06 21:57:18,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 145 transitions, 308 flow [2023-11-06 21:57:18,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2023-11-06 21:57:18,310 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:57:18,310 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 145 transitions, 308 flow [2023-11-06 21:57:18,311 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 145 transitions, 308 flow [2023-11-06 21:57:18,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 145 transitions, 308 flow [2023-11-06 21:57:18,340 INFO L124 PetriNetUnfolderBase]: 13/182 cut-off events. [2023-11-06 21:57:18,340 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 21:57:18,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 182 events. 13/182 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 567 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-11-06 21:57:18,351 INFO L119 LiptonReduction]: Number of co-enabled transitions 12636 [2023-11-06 21:57:19,671 INFO L134 LiptonReduction]: Checked pairs total: 39290 [2023-11-06 21:57:19,672 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-11-06 21:57:19,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:57:19,678 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=LoopsAndPotentialCycles, 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;@39fb7332, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:57:19,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-11-06 21:57:19,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:57:19,682 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-06 21:57:19,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:57:19,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:19,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 21:57:19,683 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-06 21:57:19,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash 745611127, now seen corresponding path program 1 times [2023-11-06 21:57:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744527295] [2023-11-06 21:57:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:19,737 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-06 21:57:19,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:19,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744527295] [2023-11-06 21:57:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744527295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:19,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:19,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:19,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932136208] [2023-11-06 21:57:19,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:19,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:19,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:19,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 240 [2023-11-06 21:57:19,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-06 21:57:19,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:19,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 240 [2023-11-06 21:57:19,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:21,660 INFO L124 PetriNetUnfolderBase]: 8205/15059 cut-off events. [2023-11-06 21:57:21,660 INFO L125 PetriNetUnfolderBase]: For 868/868 co-relation queries the response was YES. [2023-11-06 21:57:21,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27393 conditions, 15059 events. 8205/15059 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 129668 event pairs, 3588 based on Foata normal form. 0/13040 useless extension candidates. Maximal degree in co-relation 17896. Up to 7641 conditions per place. [2023-11-06 21:57:21,808 INFO L140 encePairwiseOnDemand]: 227/240 looper letters, 58 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-11-06 21:57:21,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 362 flow [2023-11-06 21:57:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-06 21:57:21,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5958333333333333 [2023-11-06 21:57:21,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-06 21:57:21,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-06 21:57:21,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:21,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-06 21:57:21,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-06 21:57:21,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:21,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:21,817 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 156 flow. Second operand 3 states and 429 transitions. [2023-11-06 21:57:21,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 362 flow [2023-11-06 21:57:21,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 358 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-06 21:57:21,821 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 230 flow [2023-11-06 21:57:21,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2023-11-06 21:57:21,822 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2023-11-06 21:57:21,823 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 230 flow [2023-11-06 21:57:21,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-06 21:57:21,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:21,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:21,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:57:21,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-06 21:57:21,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1069061163, now seen corresponding path program 1 times [2023-11-06 21:57:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595113176] [2023-11-06 21:57:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,866 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-06 21:57:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:21,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595113176] [2023-11-06 21:57:21,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595113176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:21,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:21,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:21,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79883557] [2023-11-06 21:57:21,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:21,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:21,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:21,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-11-06 21:57:21,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:57:21,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:21,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-11-06 21:57:21,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:26,199 INFO L124 PetriNetUnfolderBase]: 24567/40890 cut-off events. [2023-11-06 21:57:26,199 INFO L125 PetriNetUnfolderBase]: For 8441/8442 co-relation queries the response was YES. [2023-11-06 21:57:26,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84819 conditions, 40890 events. 24567/40890 cut-off events. For 8441/8442 co-relation queries the response was YES. Maximal size of possible extension queue 2513. Compared 372447 event pairs, 10434 based on Foata normal form. 0/36822 useless extension candidates. Maximal degree in co-relation 47527. Up to 18161 conditions per place. [2023-11-06 21:57:26,520 INFO L140 encePairwiseOnDemand]: 219/240 looper letters, 77 selfloop transitions, 15 changer transitions 0/119 dead transitions. [2023-11-06 21:57:26,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 119 transitions, 538 flow [2023-11-06 21:57:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-11-06 21:57:26,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2023-11-06 21:57:26,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-11-06 21:57:26,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-11-06 21:57:26,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:26,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-11-06 21:57:26,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-06 21:57:26,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:26,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:26,530 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 230 flow. Second operand 3 states and 418 transitions. [2023-11-06 21:57:26,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 119 transitions, 538 flow [2023-11-06 21:57:26,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 119 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:57:26,874 INFO L231 Difference]: Finished difference. Result has 78 places, 92 transitions, 344 flow [2023-11-06 21:57:26,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=78, PETRI_TRANSITIONS=92} [2023-11-06 21:57:26,875 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2023-11-06 21:57:26,876 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 344 flow [2023-11-06 21:57:26,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:57:26,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:26,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:26,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:57:26,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-06 21:57:26,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1217973897, now seen corresponding path program 1 times [2023-11-06 21:57:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184380020] [2023-11-06 21:57:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:26,917 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-06 21:57:26,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184380020] [2023-11-06 21:57:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184380020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:26,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992950519] [2023-11-06 21:57:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:26,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:26,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 240 [2023-11-06 21:57:26,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 92 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-06 21:57:26,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:26,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 240 [2023-11-06 21:57:26,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:30,475 INFO L124 PetriNetUnfolderBase]: 21069/37250 cut-off events. [2023-11-06 21:57:30,475 INFO L125 PetriNetUnfolderBase]: For 19272/20515 co-relation queries the response was YES. [2023-11-06 21:57:30,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88386 conditions, 37250 events. 21069/37250 cut-off events. For 19272/20515 co-relation queries the response was YES. Maximal size of possible extension queue 2232. Compared 354036 event pairs, 12468 based on Foata normal form. 142/33494 useless extension candidates. Maximal degree in co-relation 55920. Up to 25456 conditions per place. [2023-11-06 21:57:30,746 INFO L140 encePairwiseOnDemand]: 230/240 looper letters, 66 selfloop transitions, 16 changer transitions 0/125 dead transitions. [2023-11-06 21:57:30,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 632 flow [2023-11-06 21:57:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-11-06 21:57:30,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575 [2023-11-06 21:57:30,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-11-06 21:57:30,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-11-06 21:57:30,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:30,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-11-06 21:57:30,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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-06 21:57:30,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:30,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:30,758 INFO L175 Difference]: Start difference. First operand has 78 places, 92 transitions, 344 flow. Second operand 3 states and 414 transitions. [2023-11-06 21:57:30,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 632 flow [2023-11-06 21:57:30,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:57:30,809 INFO L231 Difference]: Finished difference. Result has 80 places, 106 transitions, 460 flow [2023-11-06 21:57:30,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=80, PETRI_TRANSITIONS=106} [2023-11-06 21:57:30,811 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2023-11-06 21:57:30,811 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 106 transitions, 460 flow [2023-11-06 21:57:30,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-06 21:57:30,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:30,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:30,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:57:30,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-06 21:57:30,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -775951299, now seen corresponding path program 1 times [2023-11-06 21:57:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:30,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664204611] [2023-11-06 21:57:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:30,866 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-06 21:57:30,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:30,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664204611] [2023-11-06 21:57:30,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664204611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:30,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:30,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:30,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624876595] [2023-11-06 21:57:30,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:30,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:30,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:30,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:30,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 240 [2023-11-06 21:57:30,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 106 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-06 21:57:30,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:30,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 240 [2023-11-06 21:57:30,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:31,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] L688-8-->L689: Formula: (and (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|) (= |v_#race~s~0_Out_46| 0) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|) |v_thr1Thread2of3ForFork0_#t~short3#1_In_3|) InVars {thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread2of3ForFork0_#t~short3#1=|v_thr1Thread2of3ForFork0_#t~short3#1_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_46|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, #race~s~0, thr1Thread2of3ForFork0_#t~short3#1][39], [42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 83#L689-1true, 90#L688-1true, Black: 145#true, 157#true, 134#L689true, thr1Thread1of3ForFork0InUse, Black: 151#true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:31,348 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 21:57:31,348 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:57:31,348 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:57:31,348 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:57:31,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] L688-8-->L689: Formula: (and (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|) (= |v_#race~s~0_Out_46| 0) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|) |v_thr1Thread2of3ForFork0_#t~short3#1_In_3|) InVars {thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread2of3ForFork0_#t~short3#1=|v_thr1Thread2of3ForFork0_#t~short3#1_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_46|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, #race~s~0, thr1Thread2of3ForFork0_#t~short3#1][39], [60#L688-5true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 83#L689-1true, Black: 145#true, 157#true, 134#L689true, thr1Thread1of3ForFork0InUse, Black: 151#true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:31,534 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,535 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,535 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,535 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 21:57:31,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] L688-8-->L689: Formula: (and (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|) (= |v_#race~s~0_Out_46| 0) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|) |v_thr1Thread2of3ForFork0_#t~short3#1_In_3|) InVars {thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread2of3ForFork0_#t~short3#1=|v_thr1Thread2of3ForFork0_#t~short3#1_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_46|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, #race~s~0, thr1Thread2of3ForFork0_#t~short3#1][39], [42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 83#L689-1true, Black: 145#true, 122#L688-8true, 157#true, 134#L689true, thr1Thread1of3ForFork0InUse, Black: 151#true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:31,535 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,536 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,536 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,536 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 21:57:31,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] L688-8-->L689: Formula: (and (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|) (= |v_#race~s~0_Out_46| 0) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|) |v_thr1Thread2of3ForFork0_#t~short3#1_In_3|) InVars {thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread2of3ForFork0_#t~short3#1=|v_thr1Thread2of3ForFork0_#t~short3#1_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_46|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, #race~s~0, thr1Thread2of3ForFork0_#t~short3#1][39], [Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 83#L689-1true, 90#L688-1true, Black: 145#true, 157#true, 107#L696-4true, 134#L689true, Black: 151#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:31,602 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 21:57:31,602 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:57:31,602 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 21:57:31,602 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 21:57:31,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] L688-8-->L689: Formula: (and (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|) (= |v_#race~s~0_Out_46| 0) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|) |v_thr1Thread2of3ForFork0_#t~short3#1_In_3|) InVars {thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread2of3ForFork0_#t~short3#1=|v_thr1Thread2of3ForFork0_#t~short3#1_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_46|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, #race~s~0, thr1Thread2of3ForFork0_#t~short3#1][39], [60#L688-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 83#L689-1true, Black: 145#true, 157#true, 107#L696-4true, 134#L689true, thr1Thread1of3ForFork0InUse, Black: 151#true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:31,933 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 21:57:31,933 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:31,933 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:31,933 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] L688-8-->L689: Formula: (and (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|) (= |v_#race~s~0_Out_46| 0) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|) |v_thr1Thread2of3ForFork0_#t~short3#1_In_3|) InVars {thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread2of3ForFork0_#t~short3#1=|v_thr1Thread2of3ForFork0_#t~short3#1_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_46|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, #race~s~0, thr1Thread2of3ForFork0_#t~short3#1][39], [Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 83#L689-1true, Black: 145#true, 122#L688-8true, 157#true, 107#L696-4true, 134#L689true, thr1Thread1of3ForFork0InUse, Black: 151#true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:31,934 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 21:57:31,934 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:31,934 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:57:31,934 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:32,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 157#true, 46#L690-1true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:32,344 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 21:57:32,344 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:32,344 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:32,344 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:32,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][116], [136#L688-7true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 18#L689-5true, Black: 145#true, 157#true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:32,570 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 21:57:32,570 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 21:57:32,570 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:32,570 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 21:57:32,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 42#L696-5true, Black: 147#(= |#race~l~0| 0), 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 157#true, 13#L690-3true, Black: 151#true, thr1Thread1of3ForFork0InUse, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:32,744 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-11-06 21:57:32,744 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-06 21:57:32,744 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-06 21:57:32,745 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-06 21:57:32,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 114#thr1EXITtrue, Black: 147#(= |#race~l~0| 0), 157#true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:32,752 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 21:57:32,752 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:32,752 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:32,752 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 157#true, 107#L696-4true, 46#L690-1true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,024 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 21:57:33,025 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,025 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,025 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 147#(= |#race~l~0| 0), 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 157#true, 13#L690-3true, 56#L689-1true, Black: 151#true, thr1Thread1of3ForFork0InUse, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,111 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,111 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,111 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,111 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,121 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [136#L688-7true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 147#(= |#race~l~0| 0), 157#true, 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 13#L690-3true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,121 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 157#true, 46#L690-1true, Black: 151#true, thr1Thread1of3ForFork0InUse, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,122 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:33,122 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 21:57:33,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][116], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 18#L689-5true, Black: 145#true, 157#true, 107#L696-4true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,239 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,239 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,239 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [136#L688-7true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 157#true, 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 13#L690-3true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,346 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,346 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,346 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,346 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 42#L696-5true, Black: 145#true, 157#true, 13#L690-3true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,346 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,346 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,346 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,347 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 21:57:33,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 42#L696-5true, Black: 145#true, 157#true, 12#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,347 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,347 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,347 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,347 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 147#(= |#race~l~0| 0), 107#L696-4true, 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 157#true, 13#L690-3true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,408 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-06 21:57:33,408 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-06 21:57:33,408 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-06 21:57:33,408 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-06 21:57:33,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 114#thr1EXITtrue, Black: 147#(= |#race~l~0| 0), 157#true, 107#L696-4true, Black: 151#true, thr1Thread1of3ForFork0InUse, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,413 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 21:57:33,413 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,413 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,413 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, 42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 114#thr1EXITtrue, Black: 145#true, 157#true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,464 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,464 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,464 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,464 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [42#L696-5true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 12#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 157#true, 56#L689-1true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,488 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,488 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,488 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,488 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,494 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 42#L696-5true, 114#thr1EXITtrue, Black: 147#(= |#race~l~0| 0), 157#true, Black: 151#true, thr1Thread1of3ForFork0InUse, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,494 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,494 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,494 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,495 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,495 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 21:57:33,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 147#(= |#race~l~0| 0), 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 107#L696-4true, 157#true, 13#L690-3true, 56#L689-1true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,543 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 21:57:33,543 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,543 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 21:57:33,543 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,554 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 147#(= |#race~l~0| 0), 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 107#L696-4true, 157#true, 13#L690-3true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,554 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 21:57:33,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,554 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 21:57:33,555 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 107#L696-4true, 157#true, 46#L690-1true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,555 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 21:57:33,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,555 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 21:57:33,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 21:57:33,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][119], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 165#(= |#race~l~0| |thr1Thread1of3ForFork0_#t~nondet5#1|), 107#L696-4true, 157#true, 13#L690-3true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,861 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 21:57:33,861 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,861 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,861 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 107#L696-4true, 157#true, 13#L690-3true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,862 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 21:57:33,862 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,862 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,862 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 21:57:33,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 12#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 107#L696-4true, 157#true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,862 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 21:57:33,862 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,863 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,863 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 114#thr1EXITtrue, Black: 145#true, 157#true, 107#L696-4true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,943 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 21:57:33,943 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,943 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,943 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), Black: 145#true, 107#L696-4true, 12#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 157#true, 56#L689-1true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,968 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 21:57:33,968 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 21:57:33,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,973 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([756] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3#1_In_3| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|) (= |v_#race~s~0_Out_42| 0)) InVars {thr1Thread3of3ForFork0_#t~short3#1=|v_thr1Thread3of3ForFork0_#t~short3#1_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_In_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_In_3|} OutVars{#race~s~0=|v_#race~s~0_Out_42|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_Out_6|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_Out_6|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, #race~s~0][58], [136#L688-7true, Black: 159#(= |#race~s~0| |thr1Thread1of3ForFork0_#t~nondet4#1|), 114#thr1EXITtrue, Black: 147#(= |#race~l~0| 0), 107#L696-4true, 157#true, thr1Thread1of3ForFork0InUse, Black: 151#true, 127#L689true, thr1Thread2of3ForFork0InUse, 163#true, thr1Thread3of3ForFork0InUse]) [2023-11-06 21:57:33,974 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 21:57:33,974 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,974 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,974 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 21:57:33,974 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 21:57:34,278 INFO L124 PetriNetUnfolderBase]: 19741/35534 cut-off events. [2023-11-06 21:57:34,278 INFO L125 PetriNetUnfolderBase]: For 26995/30771 co-relation queries the response was YES. [2023-11-06 21:57:34,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89663 conditions, 35534 events. 19741/35534 cut-off events. For 26995/30771 co-relation queries the response was YES. Maximal size of possible extension queue 2158. Compared 343676 event pairs, 10833 based on Foata normal form. 669/31549 useless extension candidates. Maximal degree in co-relation 61427. Up to 23614 conditions per place. [2023-11-06 21:57:34,822 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 66 selfloop transitions, 11 changer transitions 0/134 dead transitions. [2023-11-06 21:57:34,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 134 transitions, 720 flow [2023-11-06 21:57:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-11-06 21:57:34,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2023-11-06 21:57:34,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-11-06 21:57:34,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-11-06 21:57:34,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:34,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-11-06 21:57:34,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-06 21:57:34,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:34,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 21:57:34,832 INFO L175 Difference]: Start difference. First operand has 80 places, 106 transitions, 460 flow. Second operand 3 states and 416 transitions. [2023-11-06 21:57:34,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 134 transitions, 720 flow [2023-11-06 21:57:35,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 134 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:57:35,113 INFO L231 Difference]: Finished difference. Result has 81 places, 115 transitions, 515 flow [2023-11-06 21:57:35,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=81, PETRI_TRANSITIONS=115} [2023-11-06 21:57:35,114 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2023-11-06 21:57:35,115 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 115 transitions, 515 flow [2023-11-06 21:57:35,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-06 21:57:35,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:35,116 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-06 21:57:35,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:57:35,116 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-06 21:57:35,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1129985771, now seen corresponding path program 1 times [2023-11-06 21:57:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:35,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690420031] [2023-11-06 21:57:35,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:35,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:35,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:57:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:35,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:57:35,172 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:57:35,172 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2023-11-06 21:57:35,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2023-11-06 21:57:35,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2023-11-06 21:57:35,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2023-11-06 21:57:35,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2023-11-06 21:57:35,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2023-11-06 21:57:35,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2023-11-06 21:57:35,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2023-11-06 21:57:35,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2023-11-06 21:57:35,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2023-11-06 21:57:35,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2023-11-06 21:57:35,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2023-11-06 21:57:35,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2023-11-06 21:57:35,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2023-11-06 21:57:35,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2023-11-06 21:57:35,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2023-11-06 21:57:35,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2023-11-06 21:57:35,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2023-11-06 21:57:35,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2023-11-06 21:57:35,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2023-11-06 21:57:35,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2023-11-06 21:57:35,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:57:35,181 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 21:57:35,182 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 21:57:35,182 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-06 21:57:35,214 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:57:35,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 185 transitions, 398 flow [2023-11-06 21:57:35,266 INFO L124 PetriNetUnfolderBase]: 17/235 cut-off events. [2023-11-06 21:57:35,267 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 21:57:35,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 235 events. 17/235 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 800 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 190. Up to 10 conditions per place. [2023-11-06 21:57:35,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 185 transitions, 398 flow [2023-11-06 21:57:35,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 185 transitions, 398 flow [2023-11-06 21:57:35,273 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:57:35,273 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 185 transitions, 398 flow [2023-11-06 21:57:35,273 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 185 transitions, 398 flow [2023-11-06 21:57:35,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 185 transitions, 398 flow [2023-11-06 21:57:35,321 INFO L124 PetriNetUnfolderBase]: 17/235 cut-off events. [2023-11-06 21:57:35,321 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 21:57:35,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 235 events. 17/235 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 800 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 190. Up to 10 conditions per place. [2023-11-06 21:57:35,342 INFO L119 LiptonReduction]: Number of co-enabled transitions 23088 [2023-11-06 21:57:36,857 INFO L134 LiptonReduction]: Checked pairs total: 73402 [2023-11-06 21:57:36,857 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-11-06 21:57:36,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:57:36,862 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=LoopsAndPotentialCycles, 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;@39fb7332, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:57:36,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-06 21:57:36,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:57:36,865 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-06 21:57:36,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:57:36,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:36,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 21:57:36,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-06 21:57:36,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1071723138, now seen corresponding path program 1 times [2023-11-06 21:57:36,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:36,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260852167] [2023-11-06 21:57:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:36,898 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-06 21:57:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260852167] [2023-11-06 21:57:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260852167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690611900] [2023-11-06 21:57:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:36,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:36,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 302 [2023-11-06 21:57:36,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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-06 21:57:36,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:36,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 302 [2023-11-06 21:57:36,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:57,639 INFO L124 PetriNetUnfolderBase]: 150293/238463 cut-off events. [2023-11-06 21:57:57,640 INFO L125 PetriNetUnfolderBase]: For 20749/20749 co-relation queries the response was YES. [2023-11-06 21:57:58,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445441 conditions, 238463 events. 150293/238463 cut-off events. For 20749/20749 co-relation queries the response was YES. Maximal size of possible extension queue 8517. Compared 2375584 event pairs, 68820 based on Foata normal form. 0/218163 useless extension candidates. Maximal degree in co-relation 244054. Up to 121193 conditions per place. [2023-11-06 21:57:59,762 INFO L140 encePairwiseOnDemand]: 285/302 looper letters, 78 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2023-11-06 21:57:59,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 491 flow [2023-11-06 21:57:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-11-06 21:57:59,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6059602649006622 [2023-11-06 21:57:59,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-11-06 21:57:59,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-11-06 21:57:59,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:59,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-11-06 21:57:59,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 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-06 21:57:59,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-06 21:57:59,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-06 21:57:59,770 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 208 flow. Second operand 3 states and 549 transitions. [2023-11-06 21:57:59,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 491 flow [2023-11-06 21:57:59,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 479 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-06 21:57:59,784 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 304 flow [2023-11-06 21:57:59,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2023-11-06 21:57:59,785 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2023-11-06 21:57:59,785 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 304 flow [2023-11-06 21:57:59,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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-06 21:57:59,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:59,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:59,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:57:59,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-06 21:57:59,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1081942959, now seen corresponding path program 1 times [2023-11-06 21:57:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417512098] [2023-11-06 21:57:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:59,810 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-06 21:57:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417512098] [2023-11-06 21:57:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417512098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:57:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757883263] [2023-11-06 21:57:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:59,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:59,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 302 [2023-11-06 21:57:59,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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-06 21:57:59,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:59,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 302 [2023-11-06 21:57:59,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand