./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/13_unverif.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 30e01a73 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_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/13_unverif.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ --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 ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:41:22,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:41:22,474 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-23 21:41:22,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:41:22,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:41:22,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:41:22,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:41:22,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:41:22,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:41:22,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:41:22,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:41:22,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:41:22,511 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:41:22,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:41:22,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:41:22,513 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:41:22,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:41:22,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:41:22,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:41:22,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:41:22,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:41:22,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:41:22,517 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-23 21:41:22,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:41:22,518 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:41:22,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:41:22,519 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:41:22,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:41:22,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:41:22,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:41:22,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:41:22,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:41:22,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:41:22,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:41:22,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:41:22,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:41:22,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:41:22,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:41:22,525 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:41:22,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:41:22,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:41:22,526 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_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/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_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ 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 -> ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 [2023-11-23 21:41:22,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:41:22,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:41:22,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:41:22,895 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:41:22,895 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:41:22,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-ext/13_unverif.i [2023-11-23 21:41:26,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:41:26,371 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:41:26,371 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/sv-benchmarks/c/pthread-ext/13_unverif.i [2023-11-23 21:41:26,404 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/data/2aad98e48/f422ae615ace4b9eb745584cc5eb73f9/FLAG1ba5cefc3 [2023-11-23 21:41:26,420 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/data/2aad98e48/f422ae615ace4b9eb745584cc5eb73f9 [2023-11-23 21:41:26,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:41:26,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:41:26,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:41:26,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:41:26,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:41:26,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:26" (1/1) ... [2023-11-23 21:41:26,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159fba6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:26, skipping insertion in model container [2023-11-23 21:41:26,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:26" (1/1) ... [2023-11-23 21:41:26,495 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:41:26,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:41:26,960 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:41:27,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:41:27,077 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:41:27,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27 WrapperNode [2023-11-23 21:41:27,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:41:27,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:41:27,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:41:27,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:41:27,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,123 INFO L138 Inliner]: procedures = 168, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2023-11-23 21:41:27,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:41:27,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:41:27,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:41:27,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:41:27,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:41:27,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:41:27,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:41:27,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:41:27,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (1/1) ... [2023-11-23 21:41:27,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:41:27,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:41:27,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:41:27,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:41:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-23 21:41:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-23 21:41:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:41:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:41:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:41:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:41:27,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:41:27,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:41:27,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:41:27,348 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:41:27,468 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:41:27,471 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:41:27,680 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:41:27,762 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:41:27,763 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:41:27,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:27 BoogieIcfgContainer [2023-11-23 21:41:27,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:41:27,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:41:27,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:41:27,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:41:27,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:41:26" (1/3) ... [2023-11-23 21:41:27,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f87e9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:41:27, skipping insertion in model container [2023-11-23 21:41:27,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:27" (2/3) ... [2023-11-23 21:41:27,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f87e9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:41:27, skipping insertion in model container [2023-11-23 21:41:27,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:27" (3/3) ... [2023-11-23 21:41:27,776 INFO L112 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2023-11-23 21:41:27,785 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:41:27,798 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:41:27,798 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-23 21:41:27,798 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:41:27,866 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:41:27,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 61 transitions, 126 flow [2023-11-23 21:41:27,951 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2023-11-23 21:41:27,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:41:27,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 72 events. 5/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2023-11-23 21:41:27,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 61 transitions, 126 flow [2023-11-23 21:41:27,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 61 transitions, 126 flow [2023-11-23 21:41:27,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:41:27,993 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;@44686542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:41:27,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-23 21:41:28,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:41:28,005 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2023-11-23 21:41:28,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:41:28,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:28,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:28,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-23 21:41:28,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash 655665166, now seen corresponding path program 1 times [2023-11-23 21:41:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:28,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837290537] [2023-11-23 21:41:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:28,249 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-23 21:41:28,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:28,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837290537] [2023-11-23 21:41:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837290537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:41:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135256268] [2023-11-23 21:41:28,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:28,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:41:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:41:28,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:41:28,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 61 [2023-11-23 21:41:28,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 126 flow. Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-23 21:41:28,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:28,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 61 [2023-11-23 21:41:28,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:28,351 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2023-11-23 21:41:28,353 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-23 21:41:28,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 50 events. 1/50 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 5/49 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2023-11-23 21:41:28,357 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 2 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-11-23 21:41:28,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 100 flow [2023-11-23 21:41:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:41:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-23 21:41:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2023-11-23 21:41:28,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9098360655737705 [2023-11-23 21:41:28,376 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 111 transitions. [2023-11-23 21:41:28,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 111 transitions. [2023-11-23 21:41:28,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:28,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 111 transitions. [2023-11-23 21:41:28,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 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-23 21:41:28,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-23 21:41:28,389 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-23 21:41:28,391 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 126 flow. Second operand 2 states and 111 transitions. [2023-11-23 21:41:28,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 100 flow [2023-11-23 21:41:28,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 21:41:28,399 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 96 flow [2023-11-23 21:41:28,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-11-23 21:41:28,407 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -11 predicate places. [2023-11-23 21:41:28,407 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 96 flow [2023-11-23 21:41:28,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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-23 21:41:28,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:28,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:28,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:41:28,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-23 21:41:28,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1265958798, now seen corresponding path program 1 times [2023-11-23 21:41:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:28,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066508139] [2023-11-23 21:41:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:28,542 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-23 21:41:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:28,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066508139] [2023-11-23 21:41:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066508139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:28,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:28,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921684120] [2023-11-23 21:41:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:28,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:28,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:28,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:28,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 61 [2023-11-23 21:41:28,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-23 21:41:28,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:28,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 61 [2023-11-23 21:41:28,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:28,590 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2023-11-23 21:41:28,590 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-23 21:41:28,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 49 events. 1/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 55. Up to 3 conditions per place. [2023-11-23 21:41:28,592 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 3 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-11-23 21:41:28,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 102 flow [2023-11-23 21:41:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-23 21:41:28,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8142076502732241 [2023-11-23 21:41:28,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-23 21:41:28,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-23 21:41:28,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:28,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-23 21:41:28,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-23 21:41:28,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-23 21:41:28,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-23 21:41:28,601 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 96 flow. Second operand 3 states and 149 transitions. [2023-11-23 21:41:28,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 102 flow [2023-11-23 21:41:28,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 21:41:28,604 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 96 flow [2023-11-23 21:41:28,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-11-23 21:41:28,606 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2023-11-23 21:41:28,606 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 96 flow [2023-11-23 21:41:28,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-23 21:41:28,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:28,607 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:28,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:41:28,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-23 21:41:28,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1580128952, now seen corresponding path program 1 times [2023-11-23 21:41:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121470113] [2023-11-23 21:41:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:28,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:41:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:28,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:41:28,711 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:41:28,712 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-23 21:41:28,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-23 21:41:28,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-23 21:41:28,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-23 21:41:28,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-23 21:41:28,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-23 21:41:28,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-23 21:41:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-23 21:41:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-23 21:41:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-23 21:41:28,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-23 21:41:28,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-23 21:41:28,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-23 21:41:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-23 21:41:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-23 21:41:28,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:41:28,728 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-23 21:41:28,732 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 21:41:28,732 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-23 21:41:28,823 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:41:28,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 97 transitions, 204 flow [2023-11-23 21:41:28,882 INFO L124 PetriNetUnfolderBase]: 9/121 cut-off events. [2023-11-23 21:41:28,882 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-23 21:41:28,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 121 events. 9/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 275 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 83. Up to 6 conditions per place. [2023-11-23 21:41:28,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 97 transitions, 204 flow [2023-11-23 21:41:28,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 97 transitions, 204 flow [2023-11-23 21:41:28,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:41:28,891 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;@44686542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:41:28,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-23 21:41:28,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:41:28,921 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2023-11-23 21:41:28,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:41:28,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:28,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:28,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-23 21:41:28,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1094619121, now seen corresponding path program 1 times [2023-11-23 21:41:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436931436] [2023-11-23 21:41:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:29,004 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-23 21:41:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436931436] [2023-11-23 21:41:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436931436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:29,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:41:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944341058] [2023-11-23 21:41:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:29,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:41:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:41:29,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:41:29,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 97 [2023-11-23 21:41:29,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 97 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 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-23 21:41:29,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:29,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 97 [2023-11-23 21:41:29,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:29,099 INFO L124 PetriNetUnfolderBase]: 6/136 cut-off events. [2023-11-23 21:41:29,100 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-23 21:41:29,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 136 events. 6/136 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 393 event pairs, 2 based on Foata normal form. 15/126 useless extension candidates. Maximal degree in co-relation 90. Up to 9 conditions per place. [2023-11-23 21:41:29,108 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 4 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2023-11-23 21:41:29,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 166 flow [2023-11-23 21:41:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:41:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-23 21:41:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2023-11-23 21:41:29,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8969072164948454 [2023-11-23 21:41:29,121 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 174 transitions. [2023-11-23 21:41:29,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 174 transitions. [2023-11-23 21:41:29,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:29,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 174 transitions. [2023-11-23 21:41:29,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 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-23 21:41:29,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-23 21:41:29,128 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-23 21:41:29,129 INFO L175 Difference]: Start difference. First operand has 95 places, 97 transitions, 204 flow. Second operand 2 states and 174 transitions. [2023-11-23 21:41:29,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 166 flow [2023-11-23 21:41:29,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 21:41:29,133 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 158 flow [2023-11-23 21:41:29,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2023-11-23 21:41:29,134 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -17 predicate places. [2023-11-23 21:41:29,134 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 158 flow [2023-11-23 21:41:29,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 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-23 21:41:29,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:29,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:29,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:41:29,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-23 21:41:29,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash 338025651, now seen corresponding path program 1 times [2023-11-23 21:41:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441005763] [2023-11-23 21:41:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:29,233 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-23 21:41:29,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:29,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441005763] [2023-11-23 21:41:29,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441005763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535944739] [2023-11-23 21:41:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:29,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:29,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:29,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2023-11-23 21:41:29,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:29,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:29,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2023-11-23 21:41:29,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:29,368 INFO L124 PetriNetUnfolderBase]: 23/265 cut-off events. [2023-11-23 21:41:29,368 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-23 21:41:29,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 265 events. 23/265 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1270 event pairs, 4 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 323. Up to 30 conditions per place. [2023-11-23 21:41:29,372 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 11 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2023-11-23 21:41:29,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 211 flow [2023-11-23 21:41:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-11-23 21:41:29,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8178694158075601 [2023-11-23 21:41:29,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-11-23 21:41:29,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-11-23 21:41:29,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:29,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-11-23 21:41:29,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:29,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-23 21:41:29,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-23 21:41:29,390 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 158 flow. Second operand 3 states and 238 transitions. [2023-11-23 21:41:29,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 211 flow [2023-11-23 21:41:29,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 21:41:29,397 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 210 flow [2023-11-23 21:41:29,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2023-11-23 21:41:29,398 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -13 predicate places. [2023-11-23 21:41:29,399 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 210 flow [2023-11-23 21:41:29,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:29,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:29,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:29,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:41:29,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-23 21:41:29,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1575780646, now seen corresponding path program 1 times [2023-11-23 21:41:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594846073] [2023-11-23 21:41:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:29,496 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-23 21:41:29,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:29,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594846073] [2023-11-23 21:41:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594846073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979079339] [2023-11-23 21:41:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:29,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:29,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:29,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 97 [2023-11-23 21:41:29,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-23 21:41:29,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:29,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 97 [2023-11-23 21:41:29,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:29,678 INFO L124 PetriNetUnfolderBase]: 89/513 cut-off events. [2023-11-23 21:41:29,678 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-23 21:41:29,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 513 events. 89/513 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2918 event pairs, 18 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 813. Up to 150 conditions per place. [2023-11-23 21:41:29,683 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 23 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2023-11-23 21:41:29,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 315 flow [2023-11-23 21:41:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2023-11-23 21:41:29,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7903780068728522 [2023-11-23 21:41:29,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 230 transitions. [2023-11-23 21:41:29,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 230 transitions. [2023-11-23 21:41:29,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:29,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 230 transitions. [2023-11-23 21:41:29,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-23 21:41:29,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-23 21:41:29,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-23 21:41:29,690 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 210 flow. Second operand 3 states and 230 transitions. [2023-11-23 21:41:29,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 315 flow [2023-11-23 21:41:29,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 93 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:29,697 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 286 flow [2023-11-23 21:41:29,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2023-11-23 21:41:29,698 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -11 predicate places. [2023-11-23 21:41:29,698 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 286 flow [2023-11-23 21:41:29,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-23 21:41:29,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:29,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:29,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:41:29,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-23 21:41:29,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1557256733, now seen corresponding path program 1 times [2023-11-23 21:41:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527500151] [2023-11-23 21:41:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:29,742 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-23 21:41:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527500151] [2023-11-23 21:41:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527500151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:29,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:29,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:29,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464837745] [2023-11-23 21:41:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:29,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:29,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:29,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:29,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 97 [2023-11-23 21:41:29,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:29,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:29,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 97 [2023-11-23 21:41:29,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:29,885 INFO L124 PetriNetUnfolderBase]: 126/586 cut-off events. [2023-11-23 21:41:29,885 INFO L125 PetriNetUnfolderBase]: For 311/324 co-relation queries the response was YES. [2023-11-23 21:41:29,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 586 events. 126/586 cut-off events. For 311/324 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3411 event pairs, 30 based on Foata normal form. 2/511 useless extension candidates. Maximal degree in co-relation 1180. Up to 186 conditions per place. [2023-11-23 21:41:29,891 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 22 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-11-23 21:41:29,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 99 transitions, 389 flow [2023-11-23 21:41:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2023-11-23 21:41:29,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7869415807560137 [2023-11-23 21:41:29,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2023-11-23 21:41:29,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2023-11-23 21:41:29,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:29,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2023-11-23 21:41:29,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-23 21:41:29,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-23 21:41:29,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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-23 21:41:29,898 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 286 flow. Second operand 3 states and 229 transitions. [2023-11-23 21:41:29,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 99 transitions, 389 flow [2023-11-23 21:41:29,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:29,903 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 342 flow [2023-11-23 21:41:29,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2023-11-23 21:41:29,905 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -9 predicate places. [2023-11-23 21:41:29,905 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 342 flow [2023-11-23 21:41:29,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:29,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:29,906 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:29,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:41:29,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-23 21:41:29,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash -63740909, now seen corresponding path program 1 times [2023-11-23 21:41:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660247282] [2023-11-23 21:41:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:29,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:41:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:29,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:41:29,940 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:41:29,940 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2023-11-23 21:41:29,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-23 21:41:29,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-23 21:41:29,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-23 21:41:29,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-23 21:41:29,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-23 21:41:29,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-23 21:41:29,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-23 21:41:29,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-23 21:41:29,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-23 21:41:29,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-11-23 21:41:29,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-23 21:41:29,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-23 21:41:29,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-23 21:41:29,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-23 21:41:29,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-23 21:41:29,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-23 21:41:29,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-23 21:41:29,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-23 21:41:29,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-23 21:41:29,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-23 21:41:29,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-23 21:41:29,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:41:29,945 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-23 21:41:29,946 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 21:41:29,946 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-23 21:41:30,003 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:41:30,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 133 transitions, 284 flow [2023-11-23 21:41:30,040 INFO L124 PetriNetUnfolderBase]: 13/170 cut-off events. [2023-11-23 21:41:30,040 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-23 21:41:30,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 170 events. 13/170 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 465 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2023-11-23 21:41:30,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 133 transitions, 284 flow [2023-11-23 21:41:30,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 133 transitions, 284 flow [2023-11-23 21:41:30,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:41:30,054 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;@44686542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:41:30,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-23 21:41:30,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:41:30,060 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-11-23 21:41:30,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:41:30,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:30,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:30,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-23 21:41:30,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1818433521, now seen corresponding path program 1 times [2023-11-23 21:41:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135144454] [2023-11-23 21:41:30,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:30,103 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-23 21:41:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135144454] [2023-11-23 21:41:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135144454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:30,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:30,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:41:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428340342] [2023-11-23 21:41:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:30,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:41:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:41:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:41:30,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 133 [2023-11-23 21:41:30,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 133 transitions, 284 flow. Second operand has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 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-23 21:41:30,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:30,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 133 [2023-11-23 21:41:30,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:30,169 INFO L124 PetriNetUnfolderBase]: 21/328 cut-off events. [2023-11-23 21:41:30,169 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-23 21:41:30,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 328 events. 21/328 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1691 event pairs, 10 based on Foata normal form. 37/296 useless extension candidates. Maximal degree in co-relation 204. Up to 25 conditions per place. [2023-11-23 21:41:30,173 INFO L140 encePairwiseOnDemand]: 116/133 looper letters, 6 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2023-11-23 21:41:30,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 234 flow [2023-11-23 21:41:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:41:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-23 21:41:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions. [2023-11-23 21:41:30,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8909774436090225 [2023-11-23 21:41:30,176 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 237 transitions. [2023-11-23 21:41:30,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions. [2023-11-23 21:41:30,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:30,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions. [2023-11-23 21:41:30,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 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-23 21:41:30,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:30,180 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:30,180 INFO L175 Difference]: Start difference. First operand has 130 places, 133 transitions, 284 flow. Second operand 2 states and 237 transitions. [2023-11-23 21:41:30,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 234 flow [2023-11-23 21:41:30,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-23 21:41:30,186 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 220 flow [2023-11-23 21:41:30,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2023-11-23 21:41:30,187 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2023-11-23 21:41:30,188 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 220 flow [2023-11-23 21:41:30,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 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-23 21:41:30,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:30,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:30,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:41:30,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-23 21:41:30,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash -537058123, now seen corresponding path program 1 times [2023-11-23 21:41:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259454331] [2023-11-23 21:41:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:30,237 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-23 21:41:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:30,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259454331] [2023-11-23 21:41:30,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259454331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:30,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:30,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096020690] [2023-11-23 21:41:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:30,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:30,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:30,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2023-11-23 21:41:30,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:30,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:30,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2023-11-23 21:41:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:30,518 INFO L124 PetriNetUnfolderBase]: 268/1658 cut-off events. [2023-11-23 21:41:30,519 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-23 21:41:30,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 1658 events. 268/1658 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15096 event pairs, 58 based on Foata normal form. 0/1332 useless extension candidates. Maximal degree in co-relation 2150. Up to 271 conditions per place. [2023-11-23 21:41:30,539 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 17 selfloop transitions, 9 changer transitions 0/113 dead transitions. [2023-11-23 21:41:30,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 304 flow [2023-11-23 21:41:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-23 21:41:30,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2023-11-23 21:41:30,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-23 21:41:30,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-23 21:41:30,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:30,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-23 21:41:30,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-23 21:41:30,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-23 21:41:30,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-23 21:41:30,546 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 220 flow. Second operand 3 states and 323 transitions. [2023-11-23 21:41:30,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 304 flow [2023-11-23 21:41:30,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 21:41:30,550 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 298 flow [2023-11-23 21:41:30,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=111, PETRI_TRANSITIONS=111} [2023-11-23 21:41:30,554 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -19 predicate places. [2023-11-23 21:41:30,554 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 298 flow [2023-11-23 21:41:30,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:30,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:30,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:30,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:41:30,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-23 21:41:30,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash -744873091, now seen corresponding path program 1 times [2023-11-23 21:41:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635760067] [2023-11-23 21:41:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:30,616 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-23 21:41:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635760067] [2023-11-23 21:41:30,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635760067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:30,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:30,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:30,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899783784] [2023-11-23 21:41:30,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:30,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:30,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:30,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:30,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:30,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 133 [2023-11-23 21:41:30,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-23 21:41:30,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:30,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 133 [2023-11-23 21:41:30,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:31,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][104], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 61#L699-1true, 39#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 138#(= |#race~r~0| 0), 6#L701-2true, 133#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:31,916 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2023-11-23 21:41:31,916 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-23 21:41:31,916 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-23 21:41:31,916 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-23 21:41:32,047 INFO L124 PetriNetUnfolderBase]: 2449/8320 cut-off events. [2023-11-23 21:41:32,048 INFO L125 PetriNetUnfolderBase]: For 1565/1565 co-relation queries the response was YES. [2023-11-23 21:41:32,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14159 conditions, 8320 events. 2449/8320 cut-off events. For 1565/1565 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 88990 event pairs, 629 based on Foata normal form. 0/7088 useless extension candidates. Maximal degree in co-relation 14151. Up to 3187 conditions per place. [2023-11-23 21:41:32,165 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 38 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2023-11-23 21:41:32,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 478 flow [2023-11-23 21:41:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-23 21:41:32,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7794486215538847 [2023-11-23 21:41:32,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-23 21:41:32,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-23 21:41:32,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:32,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-23 21:41:32,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:32,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-23 21:41:32,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-23 21:41:32,171 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 298 flow. Second operand 3 states and 311 transitions. [2023-11-23 21:41:32,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 478 flow [2023-11-23 21:41:32,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:32,178 INFO L231 Difference]: Finished difference. Result has 113 places, 126 transitions, 412 flow [2023-11-23 21:41:32,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=113, PETRI_TRANSITIONS=126} [2023-11-23 21:41:32,180 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -17 predicate places. [2023-11-23 21:41:32,181 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 412 flow [2023-11-23 21:41:32,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-23 21:41:32,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:32,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:32,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:41:32,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-23 21:41:32,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1805512320, now seen corresponding path program 1 times [2023-11-23 21:41:32,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:32,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591554309] [2023-11-23 21:41:32,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:32,304 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-23 21:41:32,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591554309] [2023-11-23 21:41:32,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591554309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:32,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:32,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:32,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129874549] [2023-11-23 21:41:32,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:32,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:32,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:32,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:32,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:32,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2023-11-23 21:41:32,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 126 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-23 21:41:32,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:32,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2023-11-23 21:41:32,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:33,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][117], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 70#L699-5true, 96#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,500 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-23 21:41:33,500 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-23 21:41:33,500 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-23 21:41:33,500 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-23 21:41:33,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][140], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 6#L701-2true, 133#true, 148#true, 62#L699-6true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,563 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-11-23 21:41:33,563 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:33,564 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:33,564 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:33,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][117], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 96#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 133#true, 62#L699-6true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,623 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-11-23 21:41:33,623 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-23 21:41:33,623 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-23 21:41:33,624 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-23 21:41:33,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 77#L700true, 6#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,700 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-11-23 21:41:33,701 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:33,701 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:33,701 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:33,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][139], [17#L699-1true, 40#L709-4true, thr1Thread2of3ForFork0InUse, 72#L699-2true, Black: 142#true, thr1Thread3of3ForFork0InUse, 148#true, 133#true, 62#L699-6true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,810 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-23 21:41:33,810 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-23 21:41:33,810 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:33,810 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-23 21:41:33,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][140], [57#L699-2true, 40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 61#L699-1true, 133#true, 148#true, 62#L699-6true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,816 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-23 21:41:33,816 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-23 21:41:33,816 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-23 21:41:33,817 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:33,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][74], [40#L709-4true, thr1Thread2of3ForFork0InUse, 72#L699-2true, 17#L699-1true, thr1Thread3of3ForFork0InUse, Black: 142#true, 77#L700true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,910 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2023-11-23 21:41:33,910 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-23 21:41:33,910 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-23 21:41:33,910 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-23 21:41:33,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [57#L699-2true, 40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 77#L700true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:33,913 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2023-11-23 21:41:33,913 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-23 21:41:33,913 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-23 21:41:33,913 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-23 21:41:34,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 133#true, 148#true, 45#L699-2true, Black: 136#true, 144#(= |#race~s~0| 0), 119#L701-1true, thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,010 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-23 21:41:34,010 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-23 21:41:34,010 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-23 21:41:34,010 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-23 21:41:34,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 6#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), 23#L699-1true, thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,012 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-23 21:41:34,013 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-23 21:41:34,013 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-23 21:41:34,013 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-23 21:41:34,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 61#L699-1true, 13#L699-4true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), 119#L701-1true, thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,039 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2023-11-23 21:41:34,039 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-23 21:41:34,040 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-23 21:41:34,040 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-23 21:41:34,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 61#L699-1true, 6#L701-2true, 133#true, 148#true, 45#L699-2true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,043 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2023-11-23 21:41:34,043 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-23 21:41:34,043 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-23 21:41:34,043 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-23 21:41:34,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 6#L701-2true, 13#L699-4true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,072 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-23 21:41:34,072 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-23 21:41:34,072 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-23 21:41:34,072 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-23 21:41:34,101 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 77#L700true, 6#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,101 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-23 21:41:34,101 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,102 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,102 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,102 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,102 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][140], [40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 61#L699-1true, 6#L701-2true, 148#true, 133#true, 62#L699-6true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,103 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,103 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,103 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,103 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,103 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][139], [40#L709-4true, thr1Thread2of3ForFork0InUse, 113#L701-2true, 17#L699-1true, thr1Thread3of3ForFork0InUse, Black: 142#true, 133#true, 62#L699-6true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,122 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,122 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,122 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,123 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 33#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 61#L699-1true, 6#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,125 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,125 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,126 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,126 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,126 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][140], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 6#L701-2true, 62#L699-6true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,126 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,127 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,127 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,127 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,127 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,127 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][74], [40#L709-4true, thr1Thread2of3ForFork0InUse, 113#L701-2true, 17#L699-1true, thr1Thread3of3ForFork0InUse, Black: 142#true, 77#L700true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,144 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-23 21:41:34,145 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,145 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-23 21:41:34,145 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 61#L699-1true, 77#L700true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), 119#L701-1true, thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,147 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,147 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,147 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-23 21:41:34,147 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-23 21:41:34,158 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 77#L700true, 6#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,159 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-23 21:41:34,159 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-23 21:41:34,159 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,159 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,159 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,160 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-23 21:41:34,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 142#true, 61#L699-1true, 123#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), 119#L701-1true, thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,172 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-23 21:41:34,172 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:34,172 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:34,172 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:34,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 61#L699-1true, 14#L701-1true, 6#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,175 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-23 21:41:34,175 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:34,175 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:34,175 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-23 21:41:34,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([432] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][100], [40#L709-4true, thr1Thread2of3ForFork0InUse, Black: 142#true, thr1Thread3of3ForFork0InUse, 61#L699-1true, 6#L701-2true, 123#L701-2true, 133#true, 148#true, Black: 136#true, 144#(= |#race~s~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 21:41:34,181 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-23 21:41:34,181 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-23 21:41:34,181 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-23 21:41:34,181 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-23 21:41:34,190 INFO L124 PetriNetUnfolderBase]: 3436/10389 cut-off events. [2023-11-23 21:41:34,190 INFO L125 PetriNetUnfolderBase]: For 6073/6484 co-relation queries the response was YES. [2023-11-23 21:41:34,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22408 conditions, 10389 events. 3436/10389 cut-off events. For 6073/6484 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 109693 event pairs, 952 based on Foata normal form. 51/8808 useless extension candidates. Maximal degree in co-relation 22399. Up to 3885 conditions per place. [2023-11-23 21:41:34,413 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 35 selfloop transitions, 16 changer transitions 0/146 dead transitions. [2023-11-23 21:41:34,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 146 transitions, 608 flow [2023-11-23 21:41:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-23 21:41:34,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7869674185463659 [2023-11-23 21:41:34,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-23 21:41:34,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-23 21:41:34,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:34,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-23 21:41:34,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-23 21:41:34,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-23 21:41:34,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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-23 21:41:34,421 INFO L175 Difference]: Start difference. First operand has 113 places, 126 transitions, 412 flow. Second operand 3 states and 314 transitions. [2023-11-23 21:41:34,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 146 transitions, 608 flow [2023-11-23 21:41:34,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 146 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:34,438 INFO L231 Difference]: Finished difference. Result has 115 places, 140 transitions, 528 flow [2023-11-23 21:41:34,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=115, PETRI_TRANSITIONS=140} [2023-11-23 21:41:34,440 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -15 predicate places. [2023-11-23 21:41:34,440 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 140 transitions, 528 flow [2023-11-23 21:41:34,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-23 21:41:34,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:34,441 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:34,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:41:34,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-23 21:41:34,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash -686902382, now seen corresponding path program 1 times [2023-11-23 21:41:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24454189] [2023-11-23 21:41:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:34,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:41:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:34,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:41:34,503 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:41:34,503 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2023-11-23 21:41:34,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2023-11-23 21:41:34,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2023-11-23 21:41:34,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2023-11-23 21:41:34,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2023-11-23 21:41:34,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2023-11-23 21:41:34,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2023-11-23 21:41:34,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2023-11-23 21:41:34,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 29 remaining) [2023-11-23 21:41:34,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2023-11-23 21:41:34,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2023-11-23 21:41:34,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2023-11-23 21:41:34,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2023-11-23 21:41:34,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2023-11-23 21:41:34,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2023-11-23 21:41:34,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2023-11-23 21:41:34,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2023-11-23 21:41:34,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2023-11-23 21:41:34,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2023-11-23 21:41:34,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2023-11-23 21:41:34,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2023-11-23 21:41:34,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2023-11-23 21:41:34,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2023-11-23 21:41:34,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2023-11-23 21:41:34,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2023-11-23 21:41:34,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2023-11-23 21:41:34,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2023-11-23 21:41:34,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2023-11-23 21:41:34,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2023-11-23 21:41:34,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:41:34,509 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-23 21:41:34,516 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-23 21:41:34,516 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:41:34,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:41:34,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:41:34,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:41:34 BasicIcfg [2023-11-23 21:41:34,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:41:34,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:41:34,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:41:34,577 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:41:34,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:27" (3/4) ... [2023-11-23 21:41:34,579 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:41:34,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:41:34,581 INFO L158 Benchmark]: Toolchain (without parser) took 8156.57ms. Allocated memory was 165.7MB in the beginning and 455.1MB in the end (delta: 289.4MB). Free memory was 129.6MB in the beginning and 275.0MB in the end (delta: -145.4MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. [2023-11-23 21:41:34,581 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:41:34,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.75ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 110.0MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-23 21:41:34,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.37ms. Allocated memory is still 165.7MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:41:34,582 INFO L158 Benchmark]: Boogie Preprocessor took 64.97ms. Allocated memory is still 165.7MB. Free memory was 107.9MB in the beginning and 106.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:41:34,583 INFO L158 Benchmark]: RCFGBuilder took 573.97ms. Allocated memory is still 165.7MB. Free memory was 106.5MB in the beginning and 120.5MB in the end (delta: -14.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 21:41:34,583 INFO L158 Benchmark]: TraceAbstraction took 6808.31ms. Allocated memory was 165.7MB in the beginning and 455.1MB in the end (delta: 289.4MB). Free memory was 119.5MB in the beginning and 276.1MB in the end (delta: -156.5MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. [2023-11-23 21:41:34,583 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 455.1MB. Free memory was 276.1MB in the beginning and 275.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:41:34,585 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.75ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 110.0MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.37ms. Allocated memory is still 165.7MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.97ms. Allocated memory is still 165.7MB. Free memory was 107.9MB in the beginning and 106.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 573.97ms. Allocated memory is still 165.7MB. Free memory was 106.5MB in the beginning and 120.5MB in the end (delta: -14.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6808.31ms. Allocated memory was 165.7MB in the beginning and 455.1MB in the end (delta: 289.4MB). Free memory was 119.5MB in the beginning and 276.1MB in the end (delta: -156.5MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 455.1MB. Free memory was 276.1MB in the beginning and 275.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 698]: Data race detected [2023-11-23 21:41:34,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:41:34,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:41:34,616 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:41:34,617 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated Data race detected The following path leads to a data race: [L688] 0 unsigned int r = 0; VAL [r=0] [L689] 0 unsigned int s = 0; VAL [r=0, s=0] [L707] 0 pthread_t t; VAL [r=0, s=0, t={3:0}] [L708] COND TRUE 0 1 VAL [r=0, s=0, t={3:0}] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [r=0, s=0, t={3:0}] [L708] COND TRUE 0 1 VAL [r=0, s=0, t={3:0}] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [r=0, s=0, t={3:0}] [L696] 1 unsigned int l = 0; VAL [arg={0:0}, arg={0:0}, l=0, r=0, s=0] [L697] CALL 1 __VERIFIER_atomic_inc_r() [L692] EXPR 1 r!=-1 [L692] CALL 1 assume_abort_if_not(r!=-1) [L3] COND FALSE 1 !(!cond) [L692] RET 1 assume_abort_if_not(r!=-1) [L693] EXPR 1 r + 1 [L693] 1 r = r + 1 [L697] RET 1 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [arg={0:0}, arg={0:0}, l=0, r=1, s=0] [L696] 2 unsigned int l = 0; VAL [arg={0:0}, arg={0:0}, l=0, r=1, s=0] [L697] CALL 2 __VERIFIER_atomic_inc_r() [L692] EXPR 2 r!=-1 [L692] CALL 2 assume_abort_if_not(r!=-1) [L3] COND FALSE 2 !(!cond) [L692] RET 2 assume_abort_if_not(r!=-1) [L693] EXPR 2 r + 1 [L693] 2 r = r + 1 [L697] RET 2 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [arg={0:0}, arg={0:0}, l=0, r=2, s=0] Now there is a data race on ~r~0 between C: r = r + 1 [693] and C: r == 1 [698] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 91 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 124 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 17 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 157 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 47 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-23 21:41:34,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4a36565-ac2e-46ab-8b21-722cfcd55727/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE