./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9bd2c7ff 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_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/sssc12.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f04269da33313e0538e960083eba1e7b90d9e89847d2a89d06392d6991a3ed98 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:08,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:08,848 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-19 08:03:08,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:08,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:08,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:08,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:08,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:08,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:08,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:08,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:08,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:08,909 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:08,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:08,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:03:08,911 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:08,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:08,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:08,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:08,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:03:08,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:08,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:03:08,914 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 08:03:08,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:03:08,915 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:08,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:03:08,916 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:08,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:08,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:08,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:08,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:08,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:08,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:08,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:03:08,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:08,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:03:08,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:08,921 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:03:08,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:08,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:08,921 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:08,922 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_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/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_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f04269da33313e0538e960083eba1e7b90d9e89847d2a89d06392d6991a3ed98 [2023-11-19 08:03:09,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:09,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:09,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:09,204 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:09,205 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:09,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-lit/sssc12.i [2023-11-19 08:03:12,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:12,831 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:12,832 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/sv-benchmarks/c/pthread-lit/sssc12.i [2023-11-19 08:03:12,867 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/data/594754c84/91ff3ff5c0cd4933ae680afff1202e93/FLAG589e00be4 [2023-11-19 08:03:12,880 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/data/594754c84/91ff3ff5c0cd4933ae680afff1202e93 [2023-11-19 08:03:12,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:12,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:12,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:12,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:12,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:12,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:12" (1/1) ... [2023-11-19 08:03:12,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17594db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:12, skipping insertion in model container [2023-11-19 08:03:12,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:12" (1/1) ... [2023-11-19 08:03:12,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:13,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:13,493 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:13,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:13,645 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:13,645 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:13,653 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:13,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13 WrapperNode [2023-11-19 08:03:13,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:13,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:13,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:13,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:13,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,715 INFO L138 Inliner]: procedures = 275, calls = 24, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 150 [2023-11-19 08:03:13,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:13,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:13,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:13,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:13,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:13,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:13,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:13,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:13,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (1/1) ... [2023-11-19 08:03:13,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:13,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:13,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34f518f-713f-4339-a3ea-62f31d35bce4/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:03:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2023-11-19 08:03:13,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2023-11-19 08:03:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:03:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:03:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:03:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:03:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 08:03:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:03:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:13,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:13,870 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:03:14,099 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:14,102 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:03:14,511 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:03:14,578 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:03:14,578 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 08:03:14,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:14 BoogieIcfgContainer [2023-11-19 08:03:14,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:03:14,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:03:14,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:03:14,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:03:14,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:12" (1/3) ... [2023-11-19 08:03:14,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1087a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:14, skipping insertion in model container [2023-11-19 08:03:14,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:13" (2/3) ... [2023-11-19 08:03:14,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1087a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:14, skipping insertion in model container [2023-11-19 08:03:14,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:14" (3/3) ... [2023-11-19 08:03:14,604 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12.i [2023-11-19 08:03:14,614 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:03:14,640 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:03:14,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-11-19 08:03:14,641 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:03:14,743 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:03:14,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 157 transitions, 318 flow [2023-11-19 08:03:14,848 INFO L124 PetriNetUnfolderBase]: 10/169 cut-off events. [2023-11-19 08:03:14,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:14,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 169 events. 10/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 186 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-19 08:03:14,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 157 transitions, 318 flow [2023-11-19 08:03:14,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 157 transitions, 318 flow [2023-11-19 08:03:14,866 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:03:14,877 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 157 transitions, 318 flow [2023-11-19 08:03:14,880 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 157 transitions, 318 flow [2023-11-19 08:03:14,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 157 transitions, 318 flow [2023-11-19 08:03:14,919 INFO L124 PetriNetUnfolderBase]: 10/169 cut-off events. [2023-11-19 08:03:14,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:14,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 169 events. 10/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 186 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-19 08:03:14,924 INFO L119 LiptonReduction]: Number of co-enabled transitions 2310 [2023-11-19 08:03:21,002 INFO L134 LiptonReduction]: Checked pairs total: 2433 [2023-11-19 08:03:21,002 INFO L136 LiptonReduction]: Total number of compositions: 207 [2023-11-19 08:03:21,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:03:21,027 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73b676a3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:03:21,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2023-11-19 08:03:21,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:03:21,030 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:03:21,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:21,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:21,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:03:21,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-19 08:03:21,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:21,037 INFO L85 PathProgramCache]: Analyzing trace with hash 720, now seen corresponding path program 1 times [2023-11-19 08:03:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943535263] [2023-11-19 08:03:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:21,206 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-19 08:03:21,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:21,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943535263] [2023-11-19 08:03:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943535263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:03:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346271994] [2023-11-19 08:03:21,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:21,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:03:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:03:21,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:03:21,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 364 [2023-11-19 08:03:21,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 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-19 08:03:21,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:21,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 364 [2023-11-19 08:03:21,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:21,300 INFO L124 PetriNetUnfolderBase]: 7/19 cut-off events. [2023-11-19 08:03:21,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:21,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 7/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2023-11-19 08:03:21,306 INFO L140 encePairwiseOnDemand]: 344/364 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-11-19 08:03:21,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 34 flow [2023-11-19 08:03:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:03:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:03:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 313 transitions. [2023-11-19 08:03:21,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42994505494505497 [2023-11-19 08:03:21,328 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 313 transitions. [2023-11-19 08:03:21,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 313 transitions. [2023-11-19 08:03:21,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:21,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 313 transitions. [2023-11-19 08:03:21,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.5) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 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-19 08:03:21,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 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-19 08:03:21,344 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 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-19 08:03:21,346 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 60 flow. Second operand 2 states and 313 transitions. [2023-11-19 08:03:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 34 flow [2023-11-19 08:03:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:21,351 INFO L231 Difference]: Finished difference. Result has 11 places, 8 transitions, 20 flow [2023-11-19 08:03:21,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=20, PETRI_PLACES=11, PETRI_TRANSITIONS=8} [2023-11-19 08:03:21,362 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -19 predicate places. [2023-11-19 08:03:21,362 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 20 flow [2023-11-19 08:03:21,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 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-19 08:03:21,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:21,363 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 08:03:21,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:03:21,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-19 08:03:21,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash 236188278, now seen corresponding path program 1 times [2023-11-19 08:03:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:21,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996490131] [2023-11-19 08:03:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:21,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:21,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:21,508 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:03:21,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2023-11-19 08:03:21,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2023-11-19 08:03:21,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2023-11-19 08:03:21,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2023-11-19 08:03:21,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2023-11-19 08:03:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2023-11-19 08:03:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2023-11-19 08:03:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2023-11-19 08:03:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2023-11-19 08:03:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2023-11-19 08:03:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2023-11-19 08:03:21,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2023-11-19 08:03:21,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2023-11-19 08:03:21,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2023-11-19 08:03:21,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2023-11-19 08:03:21,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2023-11-19 08:03:21,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2023-11-19 08:03:21,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2023-11-19 08:03:21,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2023-11-19 08:03:21,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2023-11-19 08:03:21,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2023-11-19 08:03:21,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2023-11-19 08:03:21,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2023-11-19 08:03:21,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2023-11-19 08:03:21,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2023-11-19 08:03:21,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2023-11-19 08:03:21,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2023-11-19 08:03:21,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2023-11-19 08:03:21,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2023-11-19 08:03:21,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2023-11-19 08:03:21,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2023-11-19 08:03:21,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2023-11-19 08:03:21,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:03:21,540 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 08:03:21,545 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:03:21,546 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 08:03:21,603 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:03:21,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 235 transitions, 480 flow [2023-11-19 08:03:21,702 INFO L124 PetriNetUnfolderBase]: 17/261 cut-off events. [2023-11-19 08:03:21,703 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:03:21,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 261 events. 17/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 598 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 170. Up to 6 conditions per place. [2023-11-19 08:03:21,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 235 transitions, 480 flow [2023-11-19 08:03:21,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 235 transitions, 480 flow [2023-11-19 08:03:21,715 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:03:21,716 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 235 transitions, 480 flow [2023-11-19 08:03:21,717 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 235 transitions, 480 flow [2023-11-19 08:03:21,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 235 transitions, 480 flow [2023-11-19 08:03:21,776 INFO L124 PetriNetUnfolderBase]: 17/261 cut-off events. [2023-11-19 08:03:21,776 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:03:21,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 261 events. 17/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 598 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 170. Up to 6 conditions per place. [2023-11-19 08:03:21,792 INFO L119 LiptonReduction]: Number of co-enabled transitions 16632 [2023-11-19 08:03:26,779 INFO L134 LiptonReduction]: Checked pairs total: 83694 [2023-11-19 08:03:26,780 INFO L136 LiptonReduction]: Total number of compositions: 213 [2023-11-19 08:03:26,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:03:26,791 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73b676a3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:03:26,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-19 08:03:26,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:03:26,795 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:03:26,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:26,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:26,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:03:26,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-19 08:03:26,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1253, now seen corresponding path program 1 times [2023-11-19 08:03:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133635682] [2023-11-19 08:03:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:26,837 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-19 08:03:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:26,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133635682] [2023-11-19 08:03:26,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133635682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:26,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:26,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:03:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479886783] [2023-11-19 08:03:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:26,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:03:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:03:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:03:26,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 448 [2023-11-19 08:03:26,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 210.5) internal successors, (421), 2 states have internal predecessors, (421), 0 states have call successors, (0), 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-19 08:03:26,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:26,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 448 [2023-11-19 08:03:26,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:27,091 INFO L124 PetriNetUnfolderBase]: 363/1009 cut-off events. [2023-11-19 08:03:27,091 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-19 08:03:27,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 1009 events. 363/1009 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6867 event pairs, 279 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 940. Up to 586 conditions per place. [2023-11-19 08:03:27,101 INFO L140 encePairwiseOnDemand]: 430/448 looper letters, 26 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2023-11-19 08:03:27,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 220 flow [2023-11-19 08:03:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:03:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:03:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 464 transitions. [2023-11-19 08:03:27,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2023-11-19 08:03:27,109 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 464 transitions. [2023-11-19 08:03:27,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 464 transitions. [2023-11-19 08:03:27,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:27,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 464 transitions. [2023-11-19 08:03:27,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 232.0) internal successors, (464), 2 states have internal predecessors, (464), 0 states have call successors, (0), 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-19 08:03:27,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 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-19 08:03:27,122 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 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-19 08:03:27,122 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 204 flow. Second operand 2 states and 464 transitions. [2023-11-19 08:03:27,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 220 flow [2023-11-19 08:03:27,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:27,126 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 168 flow [2023-11-19 08:03:27,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=168, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2023-11-19 08:03:27,129 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -15 predicate places. [2023-11-19 08:03:27,129 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 168 flow [2023-11-19 08:03:27,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 210.5) internal successors, (421), 2 states have internal predecessors, (421), 0 states have call successors, (0), 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-19 08:03:27,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:27,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 08:03:27,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:03:27,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-19 08:03:27,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1161230184, now seen corresponding path program 1 times [2023-11-19 08:03:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321084843] [2023-11-19 08:03:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:27,278 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-19 08:03:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321084843] [2023-11-19 08:03:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321084843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:03:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530999178] [2023-11-19 08:03:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:27,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:27,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 448 [2023-11-19 08:03:27,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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-19 08:03:27,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:27,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 448 [2023-11-19 08:03:27,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:27,902 INFO L124 PetriNetUnfolderBase]: 1771/4006 cut-off events. [2023-11-19 08:03:27,902 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-19 08:03:27,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6986 conditions, 4006 events. 1771/4006 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 31601 event pairs, 761 based on Foata normal form. 0/3553 useless extension candidates. Maximal degree in co-relation 6981. Up to 1658 conditions per place. [2023-11-19 08:03:27,939 INFO L140 encePairwiseOnDemand]: 428/448 looper letters, 70 selfloop transitions, 14 changer transitions 0/117 dead transitions. [2023-11-19 08:03:27,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 417 flow [2023-11-19 08:03:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2023-11-19 08:03:27,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888392857142857 [2023-11-19 08:03:27,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 657 transitions. [2023-11-19 08:03:27,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 657 transitions. [2023-11-19 08:03:27,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:27,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 657 transitions. [2023-11-19 08:03:27,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:27,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 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-19 08:03:27,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 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-19 08:03:27,953 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 168 flow. Second operand 3 states and 657 transitions. [2023-11-19 08:03:27,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 417 flow [2023-11-19 08:03:27,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 417 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:27,963 INFO L231 Difference]: Finished difference. Result has 85 places, 93 transitions, 292 flow [2023-11-19 08:03:27,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=85, PETRI_TRANSITIONS=93} [2023-11-19 08:03:27,967 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -11 predicate places. [2023-11-19 08:03:27,967 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 93 transitions, 292 flow [2023-11-19 08:03:27,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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-19 08:03:27,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:27,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:27,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:03:27,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-19 08:03:27,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash 749321882, now seen corresponding path program 1 times [2023-11-19 08:03:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606230747] [2023-11-19 08:03:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:28,056 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-19 08:03:28,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606230747] [2023-11-19 08:03:28,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606230747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:28,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:28,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:03:28,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801687842] [2023-11-19 08:03:28,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:28,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:28,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:28,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 448 [2023-11-19 08:03:28,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 93 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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-19 08:03:28,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:28,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 448 [2023-11-19 08:03:28,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:28,568 INFO L124 PetriNetUnfolderBase]: 1265/3364 cut-off events. [2023-11-19 08:03:28,569 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-19 08:03:28,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5907 conditions, 3364 events. 1265/3364 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 27881 event pairs, 965 based on Foata normal form. 0/3042 useless extension candidates. Maximal degree in co-relation 5900. Up to 2005 conditions per place. [2023-11-19 08:03:28,603 INFO L140 encePairwiseOnDemand]: 443/448 looper letters, 29 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-19 08:03:28,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 89 transitions, 344 flow [2023-11-19 08:03:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions. [2023-11-19 08:03:28,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44494047619047616 [2023-11-19 08:03:28,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 598 transitions. [2023-11-19 08:03:28,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 598 transitions. [2023-11-19 08:03:28,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:28,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 598 transitions. [2023-11-19 08:03:28,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 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-19 08:03:28,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 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-19 08:03:28,616 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 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-19 08:03:28,616 INFO L175 Difference]: Start difference. First operand has 85 places, 93 transitions, 292 flow. Second operand 3 states and 598 transitions. [2023-11-19 08:03:28,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 89 transitions, 344 flow [2023-11-19 08:03:28,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:03:28,630 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 258 flow [2023-11-19 08:03:28,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2023-11-19 08:03:28,633 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -15 predicate places. [2023-11-19 08:03:28,633 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 258 flow [2023-11-19 08:03:28,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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-19 08:03:28,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:28,636 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 08:03:28,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:03:28,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-19 08:03:28,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1490602415, now seen corresponding path program 1 times [2023-11-19 08:03:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984123476] [2023-11-19 08:03:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:28,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:28,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:28,718 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:03:28,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2023-11-19 08:03:28,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2023-11-19 08:03:28,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2023-11-19 08:03:28,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2023-11-19 08:03:28,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2023-11-19 08:03:28,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2023-11-19 08:03:28,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2023-11-19 08:03:28,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2023-11-19 08:03:28,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2023-11-19 08:03:28,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2023-11-19 08:03:28,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2023-11-19 08:03:28,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2023-11-19 08:03:28,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2023-11-19 08:03:28,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2023-11-19 08:03:28,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2023-11-19 08:03:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2023-11-19 08:03:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2023-11-19 08:03:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2023-11-19 08:03:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2023-11-19 08:03:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2023-11-19 08:03:28,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2023-11-19 08:03:28,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2023-11-19 08:03:28,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2023-11-19 08:03:28,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2023-11-19 08:03:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2023-11-19 08:03:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2023-11-19 08:03:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2023-11-19 08:03:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2023-11-19 08:03:28,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2023-11-19 08:03:28,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2023-11-19 08:03:28,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2023-11-19 08:03:28,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2023-11-19 08:03:28,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2023-11-19 08:03:28,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2023-11-19 08:03:28,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2023-11-19 08:03:28,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2023-11-19 08:03:28,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2023-11-19 08:03:28,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2023-11-19 08:03:28,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2023-11-19 08:03:28,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2023-11-19 08:03:28,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2023-11-19 08:03:28,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2023-11-19 08:03:28,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2023-11-19 08:03:28,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2023-11-19 08:03:28,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:03:28,731 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-19 08:03:28,732 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:03:28,733 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 08:03:28,792 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:03:28,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 313 transitions, 644 flow [2023-11-19 08:03:28,866 INFO L124 PetriNetUnfolderBase]: 24/353 cut-off events. [2023-11-19 08:03:28,866 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:03:28,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 353 events. 24/353 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1103 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 265. Up to 8 conditions per place. [2023-11-19 08:03:28,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 313 transitions, 644 flow [2023-11-19 08:03:28,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 313 transitions, 644 flow [2023-11-19 08:03:28,879 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:03:28,880 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 313 transitions, 644 flow [2023-11-19 08:03:28,881 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 313 transitions, 644 flow [2023-11-19 08:03:28,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 313 transitions, 644 flow [2023-11-19 08:03:28,947 INFO L124 PetriNetUnfolderBase]: 24/353 cut-off events. [2023-11-19 08:03:28,948 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:03:28,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 353 events. 24/353 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1103 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 265. Up to 8 conditions per place. [2023-11-19 08:03:28,980 INFO L119 LiptonReduction]: Number of co-enabled transitions 42966 [2023-11-19 08:03:34,429 INFO L134 LiptonReduction]: Checked pairs total: 197064 [2023-11-19 08:03:34,429 INFO L136 LiptonReduction]: Total number of compositions: 264 [2023-11-19 08:03:34,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:03:34,434 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73b676a3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:03:34,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-11-19 08:03:34,435 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:03:34,435 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:03:34,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:34,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:34,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:03:34,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-19 08:03:34,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1910, now seen corresponding path program 1 times [2023-11-19 08:03:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213106880] [2023-11-19 08:03:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:34,447 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-19 08:03:34,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:34,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213106880] [2023-11-19 08:03:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213106880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:03:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354452604] [2023-11-19 08:03:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:34,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:03:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:34,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:03:34,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:03:34,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 577 [2023-11-19 08:03:34,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 277.5) internal successors, (555), 2 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:34,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:34,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 577 [2023-11-19 08:03:34,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:36,579 INFO L124 PetriNetUnfolderBase]: 7237/14602 cut-off events. [2023-11-19 08:03:36,580 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2023-11-19 08:03:36,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24978 conditions, 14602 events. 7237/14602 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 137103 event pairs, 5785 based on Foata normal form. 0/12428 useless extension candidates. Maximal degree in co-relation 7990. Up to 9900 conditions per place. [2023-11-19 08:03:36,746 INFO L140 encePairwiseOnDemand]: 554/577 looper letters, 40 selfloop transitions, 0 changer transitions 0/116 dead transitions. [2023-11-19 08:03:36,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 330 flow [2023-11-19 08:03:36,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:03:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:03:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 617 transitions. [2023-11-19 08:03:36,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346620450606586 [2023-11-19 08:03:36,751 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 617 transitions. [2023-11-19 08:03:36,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 617 transitions. [2023-11-19 08:03:36,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:36,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 617 transitions. [2023-11-19 08:03:36,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 308.5) internal successors, (617), 2 states have internal predecessors, (617), 0 states have call successors, (0), 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-19 08:03:36,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 577.0) internal successors, (1731), 3 states have internal predecessors, (1731), 0 states have call successors, (0), 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-19 08:03:36,760 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 577.0) internal successors, (1731), 3 states have internal predecessors, (1731), 0 states have call successors, (0), 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-19 08:03:36,760 INFO L175 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 617 transitions. [2023-11-19 08:03:36,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 330 flow [2023-11-19 08:03:36,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 116 transitions, 328 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:36,766 INFO L231 Difference]: Finished difference. Result has 118 places, 116 transitions, 248 flow [2023-11-19 08:03:36,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=577, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=248, PETRI_PLACES=118, PETRI_TRANSITIONS=116} [2023-11-19 08:03:36,768 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -19 predicate places. [2023-11-19 08:03:36,769 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 116 transitions, 248 flow [2023-11-19 08:03:36,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 277.5) internal successors, (555), 2 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:36,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:36,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 08:03:36,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:03:36,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-19 08:03:36,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1052066058, now seen corresponding path program 1 times [2023-11-19 08:03:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759439015] [2023-11-19 08:03:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:36,829 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-19 08:03:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:36,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759439015] [2023-11-19 08:03:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759439015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:36,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:03:36,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871882441] [2023-11-19 08:03:36,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:36,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:36,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 577 [2023-11-19 08:03:36,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 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-19 08:03:36,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:36,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 577 [2023-11-19 08:03:36,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:48,113 INFO L124 PetriNetUnfolderBase]: 60511/109213 cut-off events. [2023-11-19 08:03:48,113 INFO L125 PetriNetUnfolderBase]: For 1717/1717 co-relation queries the response was YES. [2023-11-19 08:03:48,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195589 conditions, 109213 events. 60511/109213 cut-off events. For 1717/1717 co-relation queries the response was YES. Maximal size of possible extension queue 3974. Compared 1148445 event pairs, 26223 based on Foata normal form. 0/95048 useless extension candidates. Maximal degree in co-relation 195583. Up to 48362 conditions per place. [2023-11-19 08:03:49,044 INFO L140 encePairwiseOnDemand]: 547/577 looper letters, 100 selfloop transitions, 21 changer transitions 0/171 dead transitions. [2023-11-19 08:03:49,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 171 transitions, 610 flow [2023-11-19 08:03:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2023-11-19 08:03:49,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014442518775274 [2023-11-19 08:03:49,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 868 transitions. [2023-11-19 08:03:49,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 868 transitions. [2023-11-19 08:03:49,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:49,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 868 transitions. [2023-11-19 08:03:49,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 0 states have call successors, (0), 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-19 08:03:49,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 577.0) internal successors, (2308), 4 states have internal predecessors, (2308), 0 states have call successors, (0), 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-19 08:03:49,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 577.0) internal successors, (2308), 4 states have internal predecessors, (2308), 0 states have call successors, (0), 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-19 08:03:49,062 INFO L175 Difference]: Start difference. First operand has 118 places, 116 transitions, 248 flow. Second operand 3 states and 868 transitions. [2023-11-19 08:03:49,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 171 transitions, 610 flow [2023-11-19 08:03:49,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 171 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:49,073 INFO L231 Difference]: Finished difference. Result has 122 places, 137 transitions, 434 flow [2023-11-19 08:03:49,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=577, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=122, PETRI_TRANSITIONS=137} [2023-11-19 08:03:49,076 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -15 predicate places. [2023-11-19 08:03:49,076 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 137 transitions, 434 flow [2023-11-19 08:03:49,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 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-19 08:03:49,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:49,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:49,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:03:49,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-19 08:03:49,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1718213292, now seen corresponding path program 1 times [2023-11-19 08:03:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932740695] [2023-11-19 08:03:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:49,127 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-19 08:03:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932740695] [2023-11-19 08:03:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932740695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:49,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:03:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363788358] [2023-11-19 08:03:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:49,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:49,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 577 [2023-11-19 08:03:49,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 137 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 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-19 08:03:49,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:49,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 577 [2023-11-19 08:03:49,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:50,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, 88#L1026-3true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:50,518 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 08:03:50,518 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:03:50,518 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:03:50,518 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:03:50,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [Black: 305#true, 302#true, 88#L1026-3true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:50,518 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:03:50,519 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:03:50,519 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:03:50,519 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:03:50,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 204#L1026-4true, 119#L1046-3true]) [2023-11-19 08:03:50,919 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:03:50,920 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:50,920 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:50,939 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:50,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 204#L1026-4true, 119#L1046-3true]) [2023-11-19 08:03:50,939 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 08:03:50,939 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:03:50,940 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:03:50,940 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:03:51,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1570] L1027-->L1027-1: Formula: (= |v_#race~next~0_7| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_7|} AuxVars[] AssignedVars[#race~next~0][36], [172#L1027-1true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, 166#L1013true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,182 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,182 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,182 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,182 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 166#L1013true, 91#L1016true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,184 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,184 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,184 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,184 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, 91#L1016true, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,185 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,185 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,185 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,185 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:03:51,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 66#L1031-2true, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,445 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,446 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,446 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,446 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 31#L1028-2true, 66#L1031-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,446 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,447 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,447 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,447 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:03:51,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 3#thrEXITtrue, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,688 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,688 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,688 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,688 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 3#thrEXITtrue, 31#L1028-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,689 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,689 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,689 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,689 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [65#L1032-3true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,689 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,690 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,690 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,690 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:51,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [65#L1032-3true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:51,690 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,690 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,690 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,690 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [189#L996true, 44#L1046-4true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 36#L1028-5true, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0)]) [2023-11-19 08:03:51,794 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,794 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,794 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:51,794 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:03:52,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [189#L996true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:52,217 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,217 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,217 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,217 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [44#L1046-4true, Black: 305#true, 302#true, 294#L1033-1true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 36#L1028-5true, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0)]) [2023-11-19 08:03:52,336 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 08:03:52,336 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:52,336 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:52,336 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:03:52,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [189#L996true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:52,490 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-19 08:03:52,490 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 08:03:52,490 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 08:03:52,491 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 08:03:52,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, 294#L1033-1true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:52,493 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 08:03:52,493 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:03:52,493 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:03:52,493 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:03:52,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [Black: 305#true, 302#true, 294#L1033-1true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:52,494 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,494 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,494 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,494 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:03:52,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [189#L996true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 36#L1028-5true, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:52,830 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 08:03:52,830 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:03:52,830 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:03:52,831 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:03:53,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 294#L1033-1true, thrThread2of3ForFork0InUse, 36#L1028-5true, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:53,538 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,538 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,538 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,538 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [44#L1046-4true, Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 36#L1028-5true, thrThread3of3ForFork0InUse, 196#L1026-1true, 222#L1033-5true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0)]) [2023-11-19 08:03:53,722 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,723 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,723 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,723 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:03:53,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 166#L1013true, 36#L1028-5true, thrThread3of3ForFork0InUse, 222#L1033-5true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:53,877 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:03:53,878 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:03:53,878 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:03:53,878 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:03:53,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1712] L1013-->L1026-1: Formula: (= |v_#race~next~0_212| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_212|, thrThread3of3ForFork0_acquire_#t~nondet3#1=|v_thrThread3of3ForFork0_acquire_#t~nondet3#1_21|} AuxVars[] AssignedVars[#race~next~0, thrThread3of3ForFork0_acquire_#t~nondet3#1][34], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, 31#L1028-2true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 222#L1033-5true, 196#L1026-1true, 313#(= |#race~len~0| 0), 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:53,878 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:03:53,878 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:03:53,878 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:03:53,878 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:03:54,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1662] L1028-3-->L1028-5: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_15| v_~next~0_182) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} OutVars{~next~0=v_~next~0_182, thrThread1of3ForFork0_#t~nondet5#1=|v_thrThread1of3ForFork0_#t~nondet5#1_13|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_15|} AuxVars[] AssignedVars[~next~0, thrThread1of3ForFork0_#t~nondet5#1][51], [Black: 305#true, 302#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 36#L1028-5true, thrThread3of3ForFork0InUse, 196#L1026-1true, 313#(= |#race~len~0| 0), 222#L1033-5true, 307#(= |#race~next~0| 0), 119#L1046-3true]) [2023-11-19 08:03:54,952 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:03:54,952 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:03:54,952 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:03:54,952 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event