./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 0e0057cc 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_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/13_unverif.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:50:14,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:50:14,739 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:50:14,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:50:14,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:50:14,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:50:14,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:50:14,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:50:14,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:50:14,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:50:14,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:50:14,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:50:14,812 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:50:14,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:50:14,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:50:14,814 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:50:14,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:50:14,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:50:14,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:50:14,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:50:14,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:50:14,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:50:14,818 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:50:14,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:50:14,819 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:50:14,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:50:14,819 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:50:14,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:50:14,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:50:14,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:50:14,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:14,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:50:14,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:50:14,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:50:14,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:50:14,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:50:14,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:50:14,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:50:14,825 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:50:14,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:50:14,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:50:14,826 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_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 [2023-11-26 10:50:15,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:50:15,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:50:15,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:50:15,156 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:50:15,157 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:50:15,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-ext/13_unverif.i [2023-11-26 10:50:18,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:50:18,769 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:50:18,770 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/sv-benchmarks/c/pthread-ext/13_unverif.i [2023-11-26 10:50:18,792 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/data/e209d2a44/5b4cf8f666ac4a189e8ca0962a886cb3/FLAGbcf0f3227 [2023-11-26 10:50:18,810 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/data/e209d2a44/5b4cf8f666ac4a189e8ca0962a886cb3 [2023-11-26 10:50:18,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:50:18,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:50:18,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:18,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:50:18,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:50:18,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:18" (1/1) ... [2023-11-26 10:50:18,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e24359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:18, skipping insertion in model container [2023-11-26 10:50:18,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:18" (1/1) ... [2023-11-26 10:50:18,895 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:50:19,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:19,261 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:50:19,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:19,349 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:50:19,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19 WrapperNode [2023-11-26 10:50:19,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:19,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:19,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:50:19,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:50:19,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,416 INFO L138 Inliner]: procedures = 168, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2023-11-26 10:50:19,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:19,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:50:19,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:50:19,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:50:19,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:50:19,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:50:19,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:50:19,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:50:19,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (1/1) ... [2023-11-26 10:50:19,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:19,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:19,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:50:19,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:50:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-26 10:50:19,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-26 10:50:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:50:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:50:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:50:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:50:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:50:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:50:19,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:50:19,550 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:50:19,681 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:50:19,683 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:50:19,845 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:50:19,917 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:50:19,917 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:50:19,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:19 BoogieIcfgContainer [2023-11-26 10:50:19,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:50:19,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:50:19,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:50:19,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:50:19,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:50:18" (1/3) ... [2023-11-26 10:50:19,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b0642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:19, skipping insertion in model container [2023-11-26 10:50:19,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:19" (2/3) ... [2023-11-26 10:50:19,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b0642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:19, skipping insertion in model container [2023-11-26 10:50:19,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:19" (3/3) ... [2023-11-26 10:50:19,929 INFO L112 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2023-11-26 10:50:19,939 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:50:19,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:50:19,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-26 10:50:19,951 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:50:20,015 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:50:20,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 61 transitions, 126 flow [2023-11-26 10:50:20,130 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2023-11-26 10:50:20,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:50:20,137 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-26 10:50:20,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 61 transitions, 126 flow [2023-11-26 10:50:20,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 61 transitions, 126 flow [2023-11-26 10:50:20,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:50:20,175 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;@37452ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:50:20,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-26 10:50:20,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:50:20,187 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2023-11-26 10:50:20,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:50:20,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:20,189 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-26 10:50:20,190 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-26 10:50:20,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash 655665166, now seen corresponding path program 1 times [2023-11-26 10:50:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200249265] [2023-11-26 10:50:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:20,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200249265] [2023-11-26 10:50:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200249265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:20,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:50:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924843181] [2023-11-26 10:50:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:20,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:50:20,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:50:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:50:20,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 61 [2023-11-26 10:50:20,542 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-26 10:50:20,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:20,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 61 [2023-11-26 10:50:20,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:20,605 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2023-11-26 10:50:20,608 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:50:20,609 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-26 10:50:20,610 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 2 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-11-26 10:50:20,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 100 flow [2023-11-26 10:50:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:50:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:50:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2023-11-26 10:50:20,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9098360655737705 [2023-11-26 10:50:20,632 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 111 transitions. [2023-11-26 10:50:20,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 111 transitions. [2023-11-26 10:50:20,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:20,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 111 transitions. [2023-11-26 10:50:20,642 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-26 10:50:20,647 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-26 10:50:20,648 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-26 10:50:20,650 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 126 flow. Second operand 2 states and 111 transitions. [2023-11-26 10:50:20,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 100 flow [2023-11-26 10:50:20,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:50:20,657 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 96 flow [2023-11-26 10:50:20,660 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-26 10:50:20,664 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -11 predicate places. [2023-11-26 10:50:20,664 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 96 flow [2023-11-26 10:50:20,665 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-26 10:50:20,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:20,665 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-26 10:50:20,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:50:20,666 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-26 10:50:20,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1265958798, now seen corresponding path program 1 times [2023-11-26 10:50:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511079870] [2023-11-26 10:50:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:20,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511079870] [2023-11-26 10:50:20,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511079870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:20,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572720172] [2023-11-26 10:50:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:20,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:20,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:20,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:20,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 61 [2023-11-26 10:50:20,790 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-26 10:50:20,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:20,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 61 [2023-11-26 10:50:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:20,822 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2023-11-26 10:50:20,829 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:50:20,829 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-26 10:50:20,830 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 3 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-11-26 10:50:20,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 102 flow [2023-11-26 10:50:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-26 10:50:20,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8142076502732241 [2023-11-26 10:50:20,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-26 10:50:20,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-26 10:50:20,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:20,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-26 10:50:20,836 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-26 10:50:20,838 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-26 10:50:20,838 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-26 10:50:20,839 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 96 flow. Second operand 3 states and 149 transitions. [2023-11-26 10:50:20,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 102 flow [2023-11-26 10:50:20,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:50:20,842 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 96 flow [2023-11-26 10:50:20,842 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-26 10:50:20,843 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2023-11-26 10:50:20,843 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 96 flow [2023-11-26 10:50:20,844 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-26 10:50:20,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:20,844 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-26 10:50:20,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:50:20,845 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-26 10:50:20,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1580128952, now seen corresponding path program 1 times [2023-11-26 10:50:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014604738] [2023-11-26 10:50:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:20,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:50:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:20,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:50:20,916 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:50:20,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-26 10:50:20,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-26 10:50:20,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-26 10:50:20,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-26 10:50:20,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-26 10:50:20,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-26 10:50:20,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-26 10:50:20,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-26 10:50:20,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-26 10:50:20,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-26 10:50:20,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-26 10:50:20,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-26 10:50:20,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-26 10:50:20,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-26 10:50:20,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-26 10:50:20,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:50:20,924 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-26 10:50:20,934 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:50:20,935 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 10:50:20,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:50:20,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 97 transitions, 204 flow [2023-11-26 10:50:21,038 INFO L124 PetriNetUnfolderBase]: 9/121 cut-off events. [2023-11-26 10:50:21,038 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 10:50:21,040 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-26 10:50:21,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 97 transitions, 204 flow [2023-11-26 10:50:21,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 97 transitions, 204 flow [2023-11-26 10:50:21,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:50:21,047 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;@37452ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:50:21,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-26 10:50:21,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:50:21,054 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2023-11-26 10:50:21,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:50:21,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:21,054 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-26 10:50:21,055 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-26 10:50:21,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1094619121, now seen corresponding path program 1 times [2023-11-26 10:50:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976579021] [2023-11-26 10:50:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976579021] [2023-11-26 10:50:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976579021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:21,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:50:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909550342] [2023-11-26 10:50:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:21,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:50:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:50:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:50:21,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 97 [2023-11-26 10:50:21,116 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-26 10:50:21,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:21,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 97 [2023-11-26 10:50:21,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:21,166 INFO L124 PetriNetUnfolderBase]: 6/136 cut-off events. [2023-11-26 10:50:21,167 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 10:50:21,168 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-26 10:50:21,170 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 4 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2023-11-26 10:50:21,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 166 flow [2023-11-26 10:50:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:50:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:50:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2023-11-26 10:50:21,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8969072164948454 [2023-11-26 10:50:21,173 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 174 transitions. [2023-11-26 10:50:21,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 174 transitions. [2023-11-26 10:50:21,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:21,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 174 transitions. [2023-11-26 10:50:21,176 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-26 10:50:21,178 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-26 10:50:21,179 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-26 10:50:21,179 INFO L175 Difference]: Start difference. First operand has 95 places, 97 transitions, 204 flow. Second operand 2 states and 174 transitions. [2023-11-26 10:50:21,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 166 flow [2023-11-26 10:50:21,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:50:21,183 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 158 flow [2023-11-26 10:50:21,183 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-26 10:50:21,185 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -17 predicate places. [2023-11-26 10:50:21,186 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 158 flow [2023-11-26 10:50:21,186 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-26 10:50:21,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:21,186 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-26 10:50:21,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:50:21,187 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-26 10:50:21,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 338025651, now seen corresponding path program 1 times [2023-11-26 10:50:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362278414] [2023-11-26 10:50:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:21,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362278414] [2023-11-26 10:50:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362278414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53457384] [2023-11-26 10:50:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:21,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:21,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:21,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2023-11-26 10:50:21,286 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-26 10:50:21,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:21,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2023-11-26 10:50:21,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:21,413 INFO L124 PetriNetUnfolderBase]: 23/265 cut-off events. [2023-11-26 10:50:21,413 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 10:50:21,416 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-26 10:50:21,418 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 11 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2023-11-26 10:50:21,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 211 flow [2023-11-26 10:50:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-11-26 10:50:21,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8178694158075601 [2023-11-26 10:50:21,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-11-26 10:50:21,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-11-26 10:50:21,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:21,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-11-26 10:50:21,431 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-26 10:50:21,432 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-26 10:50:21,433 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-26 10:50:21,433 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 158 flow. Second operand 3 states and 238 transitions. [2023-11-26 10:50:21,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 211 flow [2023-11-26 10:50:21,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:50:21,443 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 210 flow [2023-11-26 10:50:21,443 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-26 10:50:21,445 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -13 predicate places. [2023-11-26 10:50:21,446 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 210 flow [2023-11-26 10:50:21,446 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-26 10:50:21,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:21,447 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-26 10:50:21,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:50:21,451 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-26 10:50:21,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1575780646, now seen corresponding path program 1 times [2023-11-26 10:50:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918882623] [2023-11-26 10:50:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:21,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:21,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918882623] [2023-11-26 10:50:21,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918882623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:21,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:21,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133482569] [2023-11-26 10:50:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:21,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:21,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:21,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 97 [2023-11-26 10:50:21,600 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-26 10:50:21,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:21,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 97 [2023-11-26 10:50:21,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:21,739 INFO L124 PetriNetUnfolderBase]: 89/513 cut-off events. [2023-11-26 10:50:21,739 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-26 10:50:21,742 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-26 10:50:21,745 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 23 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2023-11-26 10:50:21,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 315 flow [2023-11-26 10:50:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2023-11-26 10:50:21,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7903780068728522 [2023-11-26 10:50:21,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 230 transitions. [2023-11-26 10:50:21,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 230 transitions. [2023-11-26 10:50:21,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:21,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 230 transitions. [2023-11-26 10:50:21,752 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-26 10:50:21,754 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-26 10:50:21,755 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-26 10:50:21,755 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 210 flow. Second operand 3 states and 230 transitions. [2023-11-26 10:50:21,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 315 flow [2023-11-26 10:50:21,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 93 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:50:21,763 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 286 flow [2023-11-26 10:50:21,764 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-26 10:50:21,767 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -11 predicate places. [2023-11-26 10:50:21,767 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 286 flow [2023-11-26 10:50:21,767 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-26 10:50:21,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:21,768 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-26 10:50:21,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:50:21,769 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-26 10:50:21,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1557256733, now seen corresponding path program 1 times [2023-11-26 10:50:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415896699] [2023-11-26 10:50:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415896699] [2023-11-26 10:50:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415896699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:21,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280937945] [2023-11-26 10:50:21,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:21,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:21,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 97 [2023-11-26 10:50:21,907 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-26 10:50:21,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:21,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 97 [2023-11-26 10:50:21,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:22,001 INFO L124 PetriNetUnfolderBase]: 126/586 cut-off events. [2023-11-26 10:50:22,002 INFO L125 PetriNetUnfolderBase]: For 311/324 co-relation queries the response was YES. [2023-11-26 10:50:22,003 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-26 10:50:22,008 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 22 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-11-26 10:50:22,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 99 transitions, 389 flow [2023-11-26 10:50:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2023-11-26 10:50:22,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7869415807560137 [2023-11-26 10:50:22,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2023-11-26 10:50:22,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2023-11-26 10:50:22,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:22,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2023-11-26 10:50:22,013 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-26 10:50:22,015 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-26 10:50:22,015 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-26 10:50:22,015 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 286 flow. Second operand 3 states and 229 transitions. [2023-11-26 10:50:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 99 transitions, 389 flow [2023-11-26 10:50:22,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:50:22,021 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 342 flow [2023-11-26 10:50:22,022 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-26 10:50:22,022 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -9 predicate places. [2023-11-26 10:50:22,022 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 342 flow [2023-11-26 10:50:22,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:22,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:22,023 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-26 10:50:22,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:50:22,024 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-26 10:50:22,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:22,024 INFO L85 PathProgramCache]: Analyzing trace with hash -63740909, now seen corresponding path program 1 times [2023-11-26 10:50:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:22,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944872407] [2023-11-26 10:50:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:22,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:50:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:22,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:50:22,055 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:50:22,055 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2023-11-26 10:50:22,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-26 10:50:22,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-26 10:50:22,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-26 10:50:22,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-26 10:50:22,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-26 10:50:22,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-26 10:50:22,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-26 10:50:22,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-26 10:50:22,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-26 10:50:22,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-11-26 10:50:22,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-26 10:50:22,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-26 10:50:22,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-26 10:50:22,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-26 10:50:22,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-26 10:50:22,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-26 10:50:22,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-26 10:50:22,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-26 10:50:22,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-26 10:50:22,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-26 10:50:22,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-26 10:50:22,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:50:22,061 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 10:50:22,062 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:50:22,062 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 10:50:22,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:50:22,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 133 transitions, 284 flow [2023-11-26 10:50:22,132 INFO L124 PetriNetUnfolderBase]: 13/170 cut-off events. [2023-11-26 10:50:22,132 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 10:50:22,133 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-26 10:50:22,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 133 transitions, 284 flow [2023-11-26 10:50:22,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 133 transitions, 284 flow [2023-11-26 10:50:22,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:50:22,139 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;@37452ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:50:22,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-26 10:50:22,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:50:22,143 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-11-26 10:50:22,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:50:22,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:22,144 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-26 10:50:22,144 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-26 10:50:22,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1818433521, now seen corresponding path program 1 times [2023-11-26 10:50:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:22,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271079292] [2023-11-26 10:50:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271079292] [2023-11-26 10:50:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271079292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:22,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:50:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884906387] [2023-11-26 10:50:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:22,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:50:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:22,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:50:22,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:50:22,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 133 [2023-11-26 10:50:22,175 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-26 10:50:22,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:22,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 133 [2023-11-26 10:50:22,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:22,242 INFO L124 PetriNetUnfolderBase]: 21/328 cut-off events. [2023-11-26 10:50:22,242 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 10:50:22,243 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-26 10:50:22,246 INFO L140 encePairwiseOnDemand]: 116/133 looper letters, 6 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2023-11-26 10:50:22,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 234 flow [2023-11-26 10:50:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:50:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:50:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions. [2023-11-26 10:50:22,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8909774436090225 [2023-11-26 10:50:22,248 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 237 transitions. [2023-11-26 10:50:22,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions. [2023-11-26 10:50:22,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:22,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions. [2023-11-26 10:50:22,250 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-26 10:50:22,251 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-26 10:50:22,252 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-26 10:50:22,252 INFO L175 Difference]: Start difference. First operand has 130 places, 133 transitions, 284 flow. Second operand 2 states and 237 transitions. [2023-11-26 10:50:22,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 234 flow [2023-11-26 10:50:22,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-26 10:50:22,257 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 220 flow [2023-11-26 10:50:22,258 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-26 10:50:22,259 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2023-11-26 10:50:22,259 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 220 flow [2023-11-26 10:50:22,260 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-26 10:50:22,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:22,260 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-26 10:50:22,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:50:22,260 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-26 10:50:22,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash -537058123, now seen corresponding path program 1 times [2023-11-26 10:50:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:22,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435767039] [2023-11-26 10:50:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:22,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:22,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:22,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435767039] [2023-11-26 10:50:22,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435767039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:22,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:22,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635222003] [2023-11-26 10:50:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:22,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:22,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2023-11-26 10:50:22,329 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-26 10:50:22,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:22,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2023-11-26 10:50:22,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:22,599 INFO L124 PetriNetUnfolderBase]: 268/1658 cut-off events. [2023-11-26 10:50:22,599 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-26 10:50:22,604 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-26 10:50:22,615 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 17 selfloop transitions, 9 changer transitions 0/113 dead transitions. [2023-11-26 10:50:22,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 304 flow [2023-11-26 10:50:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-26 10:50:22,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2023-11-26 10:50:22,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-26 10:50:22,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-26 10:50:22,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:22,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-26 10:50:22,630 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-26 10:50:22,631 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-26 10:50:22,631 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-26 10:50:22,632 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 220 flow. Second operand 3 states and 323 transitions. [2023-11-26 10:50:22,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 304 flow [2023-11-26 10:50:22,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:50:22,635 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 298 flow [2023-11-26 10:50:22,636 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-26 10:50:22,638 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -19 predicate places. [2023-11-26 10:50:22,638 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 298 flow [2023-11-26 10:50:22,638 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-26 10:50:22,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:22,639 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-26 10:50:22,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:50:22,639 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-26 10:50:22,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash -744873091, now seen corresponding path program 1 times [2023-11-26 10:50:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:22,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348944011] [2023-11-26 10:50:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348944011] [2023-11-26 10:50:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348944011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:22,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833461892] [2023-11-26 10:50:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:22,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:22,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 133 [2023-11-26 10:50:22,735 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-26 10:50:22,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:22,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 133 [2023-11-26 10:50:22,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:23,987 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-26 10:50:23,987 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2023-11-26 10:50:23,987 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:50:23,987 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:50:23,987 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:50:24,117 INFO L124 PetriNetUnfolderBase]: 2449/8320 cut-off events. [2023-11-26 10:50:24,117 INFO L125 PetriNetUnfolderBase]: For 1565/1565 co-relation queries the response was YES. [2023-11-26 10:50:24,162 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-26 10:50:24,235 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 38 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2023-11-26 10:50:24,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 478 flow [2023-11-26 10:50:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-26 10:50:24,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7794486215538847 [2023-11-26 10:50:24,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-26 10:50:24,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-26 10:50:24,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:24,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-26 10:50:24,240 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-26 10:50:24,241 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-26 10:50:24,241 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-26 10:50:24,241 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 298 flow. Second operand 3 states and 311 transitions. [2023-11-26 10:50:24,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 478 flow [2023-11-26 10:50:24,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:50:24,249 INFO L231 Difference]: Finished difference. Result has 113 places, 126 transitions, 412 flow [2023-11-26 10:50:24,250 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-26 10:50:24,251 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -17 predicate places. [2023-11-26 10:50:24,251 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 412 flow [2023-11-26 10:50:24,251 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-26 10:50:24,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:24,252 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-26 10:50:24,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:50:24,252 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-26 10:50:24,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1805512320, now seen corresponding path program 1 times [2023-11-26 10:50:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194547060] [2023-11-26 10:50:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:24,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194547060] [2023-11-26 10:50:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194547060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:24,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:24,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600823984] [2023-11-26 10:50:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:24,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:24,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2023-11-26 10:50:24,479 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-26 10:50:24,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:24,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2023-11-26 10:50:24,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:25,704 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-26 10:50:25,705 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-26 10:50:25,705 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-26 10:50:25,705 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-26 10:50:25,705 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-26 10:50:25,713 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-26 10:50:25,713 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-11-26 10:50:25,713 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:25,713 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:25,713 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:25,755 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-26 10:50:25,755 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-11-26 10:50:25,755 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-26 10:50:25,755 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-26 10:50:25,755 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-26 10:50:25,810 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-26 10:50:25,810 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-11-26 10:50:25,810 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:25,811 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:25,811 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:25,893 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-26 10:50:25,893 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-26 10:50:25,893 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:50:25,893 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:25,893 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:50:25,897 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-26 10:50:25,897 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-26 10:50:25,897 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:50:25,897 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:50:25,898 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:26,047 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-26 10:50:26,048 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2023-11-26 10:50:26,048 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:50:26,048 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-26 10:50:26,048 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:50:26,050 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-26 10:50:26,050 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2023-11-26 10:50:26,050 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-26 10:50:26,050 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:50:26,050 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:50:26,118 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-26 10:50:26,118 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-26 10:50:26,118 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:50:26,118 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:50:26,118 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:50:26,120 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-26 10:50:26,120 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-26 10:50:26,120 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:50:26,120 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:50:26,120 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:50:26,139 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-26 10:50:26,139 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2023-11-26 10:50:26,139 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:50:26,139 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:50:26,140 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-26 10:50:26,142 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-26 10:50:26,142 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2023-11-26 10:50:26,142 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:50:26,142 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:50:26,142 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:50:26,163 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-26 10:50:26,164 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-26 10:50:26,164 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-26 10:50:26,164 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-26 10:50:26,164 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:50:26,185 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-26 10:50:26,185 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:50:26,185 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,185 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,185 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,185 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,186 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-26 10:50:26,186 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,186 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,186 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,186 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,187 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,205 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-26 10:50:26,206 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,206 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,206 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,206 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,208 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-26 10:50:26,208 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,209 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,209 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,209 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,209 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-26 10:50:26,209 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,209 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,210 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,210 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,210 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,210 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,218 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-26 10:50:26,219 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:50:26,219 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,219 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:50:26,219 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,220 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-26 10:50:26,220 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,221 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,221 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:50:26,221 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-26 10:50:26,229 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-26 10:50:26,229 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:50:26,229 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:50:26,230 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,230 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,230 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,230 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:50:26,239 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-26 10:50:26,239 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-26 10:50:26,239 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:26,239 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:26,239 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:26,241 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-26 10:50:26,241 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-26 10:50:26,241 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:26,241 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:26,242 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:50:26,245 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-26 10:50:26,245 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-26 10:50:26,246 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-26 10:50:26,246 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-26 10:50:26,246 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-26 10:50:26,252 INFO L124 PetriNetUnfolderBase]: 3436/10389 cut-off events. [2023-11-26 10:50:26,252 INFO L125 PetriNetUnfolderBase]: For 6073/6484 co-relation queries the response was YES. [2023-11-26 10:50:26,310 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-26 10:50:26,375 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 35 selfloop transitions, 16 changer transitions 0/146 dead transitions. [2023-11-26 10:50:26,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 146 transitions, 608 flow [2023-11-26 10:50:26,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-26 10:50:26,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7869674185463659 [2023-11-26 10:50:26,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-26 10:50:26,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-26 10:50:26,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:26,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-26 10:50:26,381 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-26 10:50:26,383 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-26 10:50:26,383 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-26 10:50:26,383 INFO L175 Difference]: Start difference. First operand has 113 places, 126 transitions, 412 flow. Second operand 3 states and 314 transitions. [2023-11-26 10:50:26,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 146 transitions, 608 flow [2023-11-26 10:50:26,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 146 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:50:26,398 INFO L231 Difference]: Finished difference. Result has 115 places, 140 transitions, 528 flow [2023-11-26 10:50:26,398 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-26 10:50:26,399 INFO L281 CegarLoopForPetriNet]: 130 programPoint places, -15 predicate places. [2023-11-26 10:50:26,399 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 140 transitions, 528 flow [2023-11-26 10:50:26,399 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-26 10:50:26,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:26,400 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-26 10:50:26,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:50:26,400 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-26 10:50:26,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -686902382, now seen corresponding path program 1 times [2023-11-26 10:50:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648776957] [2023-11-26 10:50:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:26,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:50:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:26,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:50:26,465 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:50:26,465 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2023-11-26 10:50:26,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2023-11-26 10:50:26,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2023-11-26 10:50:26,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2023-11-26 10:50:26,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2023-11-26 10:50:26,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2023-11-26 10:50:26,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2023-11-26 10:50:26,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2023-11-26 10:50:26,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 29 remaining) [2023-11-26 10:50:26,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2023-11-26 10:50:26,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2023-11-26 10:50:26,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2023-11-26 10:50:26,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2023-11-26 10:50:26,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2023-11-26 10:50:26,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2023-11-26 10:50:26,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2023-11-26 10:50:26,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2023-11-26 10:50:26,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2023-11-26 10:50:26,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2023-11-26 10:50:26,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2023-11-26 10:50:26,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2023-11-26 10:50:26,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2023-11-26 10:50:26,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2023-11-26 10:50:26,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2023-11-26 10:50:26,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2023-11-26 10:50:26,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2023-11-26 10:50:26,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2023-11-26 10:50:26,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2023-11-26 10:50:26,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2023-11-26 10:50:26,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:50:26,475 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 10:50:26,481 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-26 10:50:26,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:50:26,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:50:26,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:50:26,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:50:26 BasicIcfg [2023-11-26 10:50:26,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:50:26,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:50:26,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:50:26,547 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:50:26,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:19" (3/4) ... [2023-11-26 10:50:26,551 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:50:26,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:50:26,553 INFO L158 Benchmark]: Toolchain (without parser) took 7734.74ms. Allocated memory was 138.4MB in the beginning and 348.1MB in the end (delta: 209.7MB). Free memory was 102.8MB in the beginning and 112.5MB in the end (delta: -9.7MB). Peak memory consumption was 201.8MB. Max. memory is 16.1GB. [2023-11-26 10:50:26,553 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 138.4MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:26,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.18ms. Allocated memory is still 138.4MB. Free memory was 102.8MB in the beginning and 83.6MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 10:50:26,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.61ms. Allocated memory is still 138.4MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:50:26,554 INFO L158 Benchmark]: Boogie Preprocessor took 53.18ms. Allocated memory is still 138.4MB. Free memory was 81.5MB in the beginning and 79.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:50:26,555 INFO L158 Benchmark]: RCFGBuilder took 447.58ms. Allocated memory is still 138.4MB. Free memory was 79.9MB in the beginning and 64.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 10:50:26,555 INFO L158 Benchmark]: TraceAbstraction took 6624.18ms. Allocated memory was 138.4MB in the beginning and 348.1MB in the end (delta: 209.7MB). Free memory was 63.7MB in the beginning and 112.5MB in the end (delta: -48.8MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2023-11-26 10:50:26,555 INFO L158 Benchmark]: Witness Printer took 5.06ms. Allocated memory is still 348.1MB. Free memory is still 112.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:26,558 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.30ms. Allocated memory is still 138.4MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.18ms. Allocated memory is still 138.4MB. Free memory was 102.8MB in the beginning and 83.6MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.61ms. Allocated memory is still 138.4MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.18ms. Allocated memory is still 138.4MB. Free memory was 81.5MB in the beginning and 79.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.58ms. Allocated memory is still 138.4MB. Free memory was 79.9MB in the beginning and 64.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6624.18ms. Allocated memory was 138.4MB in the beginning and 348.1MB in the end (delta: 209.7MB). Free memory was 63.7MB in the beginning and 112.5MB in the end (delta: -48.8MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. * Witness Printer took 5.06ms. Allocated memory is still 348.1MB. Free memory is still 112.5MB. 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-26 10:50:26,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:50:26,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:50:26,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:50:26,593 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.9s, 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.1s 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.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.2s 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.0s 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-26 10:50:26,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d806a50a-1c0b-496b-80a0-ab1ac913838b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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