./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a 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_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU --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 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:23,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:23,613 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 21:58:23,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:23,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:23,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:23,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:23,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:23,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:23,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:23,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:23,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:23,666 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:23,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:23,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:23,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:23,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:58:23,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:23,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:23,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:23,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:23,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:23,679 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 21:58:23,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:23,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:58:23,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:23,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:23,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:23,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:23,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:23,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:23,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:23,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:23,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:23,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:23,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:58:23,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:58:23,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:23,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:23,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:23,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:23,686 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_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/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_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 [2024-10-31 21:58:24,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:24,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:24,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:24,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:24,080 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:24,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i Unable to find full path for "g++" [2024-10-31 21:58:26,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:26,445 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:26,446 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i [2024-10-31 21:58:26,474 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/data/e1a5bbab5/0a6f7a62d33b4f4b8b6dc3e4bc383588/FLAG509fdc975 [2024-10-31 21:58:26,492 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/data/e1a5bbab5/0a6f7a62d33b4f4b8b6dc3e4bc383588 [2024-10-31 21:58:26,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:26,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:26,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:26,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:26,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:26,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:26" (1/1) ... [2024-10-31 21:58:26,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0e109c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:26, skipping insertion in model container [2024-10-31 21:58:26,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:26" (1/1) ... [2024-10-31 21:58:26,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:27,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:27,087 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:27,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:27,219 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:27,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27 WrapperNode [2024-10-31 21:58:27,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:27,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:27,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:27,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:27,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,274 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2024-10-31 21:58:27,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:27,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:27,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:27,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:27,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:27,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:27,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:27,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:27,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (1/1) ... [2024-10-31 21:58:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:27,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:27,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:58:27,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fea2b935-99e2-4b22-bb9e-f41dbeab46cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:58:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-31 21:58:27,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-31 21:58:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 21:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:27,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:27,422 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 21:58:27,578 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:27,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:27,721 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:58:27,721 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:27,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:27,736 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:58:27,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:27 BoogieIcfgContainer [2024-10-31 21:58:27,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:27,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:27,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:27,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:27,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:26" (1/3) ... [2024-10-31 21:58:27,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b14027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:27, skipping insertion in model container [2024-10-31 21:58:27,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:27" (2/3) ... [2024-10-31 21:58:27,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b14027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:27, skipping insertion in model container [2024-10-31 21:58:27,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:27" (3/3) ... [2024-10-31 21:58:27,749 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs-b.i [2024-10-31 21:58:27,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:27,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 21:58:27,774 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:58:27,840 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:58:27,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 114 flow [2024-10-31 21:58:27,912 INFO L124 PetriNetUnfolderBase]: 4/64 cut-off events. [2024-10-31 21:58:27,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:27,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 64 events. 4/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2024-10-31 21:58:27,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 114 flow [2024-10-31 21:58:27,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 114 flow [2024-10-31 21:58:27,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:27,939 INFO L333 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, 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;@2e08331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:27,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 21:58:27,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:58:27,947 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2024-10-31 21:58:27,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:27,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:27,948 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:27,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:58:27,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 504996951, now seen corresponding path program 1 times [2024-10-31 21:58:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672072810] [2024-10-31 21:58:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672072810] [2024-10-31 21:58:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672072810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:28,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:28,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041205357] [2024-10-31 21:58:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:28,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:28,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 55 [2024-10-31 21:58:28,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) [2024-10-31 21:58:28,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:28,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 55 [2024-10-31 21:58:28,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:28,323 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-10-31 21:58:28,323 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 21:58:28,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 6/52 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2024-10-31 21:58:28,325 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 6 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-10-31 21:58:28,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 110 flow [2024-10-31 21:58:28,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-10-31 21:58:28,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.806060606060606 [2024-10-31 21:58:28,346 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 114 flow. Second operand 3 states and 133 transitions. [2024-10-31 21:58:28,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 110 flow [2024-10-31 21:58:28,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:28,353 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 98 flow [2024-10-31 21:58:28,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2024-10-31 21:58:28,365 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2024-10-31 21:58:28,366 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 98 flow [2024-10-31 21:58:28,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) [2024-10-31 21:58:28,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:28,366 INFO L204 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] [2024-10-31 21:58:28,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:58:28,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:58:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1190641419, now seen corresponding path program 1 times [2024-10-31 21:58:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860179393] [2024-10-31 21:58:28,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:28,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:58:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:28,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:58:28,437 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:58:28,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-31 21:58:28,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-31 21:58:28,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-31 21:58:28,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-10-31 21:58:28,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-31 21:58:28,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-31 21:58:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:58:28,451 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-31 21:58:28,454 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 21:58:28,454 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-31 21:58:28,484 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:58:28,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 81 transitions, 172 flow [2024-10-31 21:58:28,537 INFO L124 PetriNetUnfolderBase]: 7/99 cut-off events. [2024-10-31 21:58:28,537 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 21:58:28,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 99 events. 7/99 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 149 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 65. Up to 6 conditions per place. [2024-10-31 21:58:28,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 81 transitions, 172 flow [2024-10-31 21:58:28,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 81 transitions, 172 flow [2024-10-31 21:58:28,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:28,545 INFO L333 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, 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;@2e08331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:28,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-31 21:58:28,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:58:28,557 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2024-10-31 21:58:28,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:28,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:28,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:28,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:58:28,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1703535048, now seen corresponding path program 1 times [2024-10-31 21:58:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098453008] [2024-10-31 21:58:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098453008] [2024-10-31 21:58:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098453008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232916403] [2024-10-31 21:58:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:28,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:28,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2024-10-31 21:58:28,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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) [2024-10-31 21:58:28,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:28,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2024-10-31 21:58:28,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:28,838 INFO L124 PetriNetUnfolderBase]: 6/135 cut-off events. [2024-10-31 21:58:28,838 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-31 21:58:28,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 135 events. 6/135 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 359 event pairs, 6 based on Foata normal form. 27/149 useless extension candidates. Maximal degree in co-relation 41. Up to 22 conditions per place. [2024-10-31 21:58:28,842 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 9 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-10-31 21:58:28,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 166 flow [2024-10-31 21:58:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-10-31 21:58:28,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2024-10-31 21:58:28,856 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 172 flow. Second operand 3 states and 198 transitions. [2024-10-31 21:58:28,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 166 flow [2024-10-31 21:58:28,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:28,865 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 148 flow [2024-10-31 21:58:28,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-10-31 21:58:28,872 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, -7 predicate places. [2024-10-31 21:58:28,873 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 148 flow [2024-10-31 21:58:28,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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) [2024-10-31 21:58:28,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:28,874 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:28,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:58:28,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:58:28,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1170889968, now seen corresponding path program 1 times [2024-10-31 21:58:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862044328] [2024-10-31 21:58:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:28,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:58:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:28,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:58:28,950 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:58:28,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-10-31 21:58:28,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-31 21:58:28,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-31 21:58:28,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-31 21:58:28,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-31 21:58:28,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-31 21:58:28,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-31 21:58:28,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-31 21:58:28,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:58:28,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-31 21:58:28,959 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 21:58:28,959 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-31 21:58:29,006 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:58:29,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 107 transitions, 232 flow [2024-10-31 21:58:29,035 INFO L124 PetriNetUnfolderBase]: 10/134 cut-off events. [2024-10-31 21:58:29,035 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-31 21:58:29,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 10/134 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 298 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 103. Up to 8 conditions per place. [2024-10-31 21:58:29,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 107 transitions, 232 flow [2024-10-31 21:58:29,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 107 transitions, 232 flow [2024-10-31 21:58:29,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:29,042 INFO L333 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, 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;@2e08331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:29,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-31 21:58:29,046 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:58:29,046 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2024-10-31 21:58:29,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:29,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:29,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:29,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-31 21:58:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -690032493, now seen corresponding path program 1 times [2024-10-31 21:58:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662464778] [2024-10-31 21:58:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:29,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:29,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662464778] [2024-10-31 21:58:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662464778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:29,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:29,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:29,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59120537] [2024-10-31 21:58:29,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:29,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:29,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2024-10-31 21:58:29,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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) [2024-10-31 21:58:29,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:29,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2024-10-31 21:58:29,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:29,318 INFO L124 PetriNetUnfolderBase]: 42/411 cut-off events. [2024-10-31 21:58:29,319 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-10-31 21:58:29,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 411 events. 42/411 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2277 event pairs, 42 based on Foata normal form. 108/476 useless extension candidates. Maximal degree in co-relation 166. Up to 85 conditions per place. [2024-10-31 21:58:29,329 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 12 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-10-31 21:58:29,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 224 flow [2024-10-31 21:58:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-10-31 21:58:29,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8193146417445483 [2024-10-31 21:58:29,337 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 232 flow. Second operand 3 states and 263 transitions. [2024-10-31 21:58:29,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 89 transitions, 224 flow [2024-10-31 21:58:29,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 222 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:29,343 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 198 flow [2024-10-31 21:58:29,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-10-31 21:58:29,346 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -9 predicate places. [2024-10-31 21:58:29,346 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 198 flow [2024-10-31 21:58:29,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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) [2024-10-31 21:58:29,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:29,348 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:29,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:58:29,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-31 21:58:29,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash 41842299, now seen corresponding path program 1 times [2024-10-31 21:58:29,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:29,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907395932] [2024-10-31 21:58:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:29,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:29,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:29,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907395932] [2024-10-31 21:58:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907395932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:29,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:29,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750539957] [2024-10-31 21:58:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:29,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:29,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:29,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2024-10-31 21:58:29,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2024-10-31 21:58:29,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:29,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2024-10-31 21:58:29,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:29,652 INFO L124 PetriNetUnfolderBase]: 135/738 cut-off events. [2024-10-31 21:58:29,653 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-10-31 21:58:29,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 738 events. 135/738 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5073 event pairs, 80 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 1056. Up to 201 conditions per place. [2024-10-31 21:58:29,660 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 15 selfloop transitions, 7 changer transitions 0/97 dead transitions. [2024-10-31 21:58:29,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 268 flow [2024-10-31 21:58:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2024-10-31 21:58:29,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.838006230529595 [2024-10-31 21:58:29,663 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 198 flow. Second operand 3 states and 269 transitions. [2024-10-31 21:58:29,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 268 flow [2024-10-31 21:58:29,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:29,668 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 248 flow [2024-10-31 21:58:29,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2024-10-31 21:58:29,670 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -7 predicate places. [2024-10-31 21:58:29,670 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 248 flow [2024-10-31 21:58:29,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2024-10-31 21:58:29,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:29,671 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:29,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:58:29,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-31 21:58:29,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 983792036, now seen corresponding path program 1 times [2024-10-31 21:58:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298520817] [2024-10-31 21:58:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:29,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:29,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298520817] [2024-10-31 21:58:29,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298520817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:29,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415481850] [2024-10-31 21:58:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:29,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:29,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:29,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2024-10-31 21:58:29,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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) [2024-10-31 21:58:29,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:29,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2024-10-31 21:58:29,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:30,057 INFO L124 PetriNetUnfolderBase]: 351/1558 cut-off events. [2024-10-31 21:58:30,058 INFO L125 PetriNetUnfolderBase]: For 527/595 co-relation queries the response was YES. [2024-10-31 21:58:30,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2784 conditions, 1558 events. 351/1558 cut-off events. For 527/595 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13399 event pairs, 79 based on Foata normal form. 3/1294 useless extension candidates. Maximal degree in co-relation 1402. Up to 392 conditions per place. [2024-10-31 21:58:30,118 INFO L140 encePairwiseOnDemand]: 95/107 looper letters, 22 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2024-10-31 21:58:30,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 110 transitions, 386 flow [2024-10-31 21:58:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-10-31 21:58:30,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8411214953271028 [2024-10-31 21:58:30,121 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 248 flow. Second operand 3 states and 270 transitions. [2024-10-31 21:58:30,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 110 transitions, 386 flow [2024-10-31 21:58:30,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 110 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:30,131 INFO L231 Difference]: Finished difference. Result has 102 places, 108 transitions, 362 flow [2024-10-31 21:58:30,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=102, PETRI_TRANSITIONS=108} [2024-10-31 21:58:30,134 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -5 predicate places. [2024-10-31 21:58:30,135 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 108 transitions, 362 flow [2024-10-31 21:58:30,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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) [2024-10-31 21:58:30,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:30,136 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:58:30,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-31 21:58:30,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash -692126326, now seen corresponding path program 1 times [2024-10-31 21:58:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013545340] [2024-10-31 21:58:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:30,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:58:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:30,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:58:30,200 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:58:30,200 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-10-31 21:58:30,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-10-31 21:58:30,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-10-31 21:58:30,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-10-31 21:58:30,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-10-31 21:58:30,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-10-31 21:58:30,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-10-31 21:58:30,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-10-31 21:58:30,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-10-31 21:58:30,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-10-31 21:58:30,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:58:30,207 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-31 21:58:30,207 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 21:58:30,208 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-31 21:58:30,261 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:58:30,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 133 transitions, 294 flow [2024-10-31 21:58:30,300 INFO L124 PetriNetUnfolderBase]: 13/169 cut-off events. [2024-10-31 21:58:30,300 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-31 21:58:30,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 169 events. 13/169 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 433 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 142. Up to 10 conditions per place. [2024-10-31 21:58:30,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 133 transitions, 294 flow [2024-10-31 21:58:30,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 133 transitions, 294 flow [2024-10-31 21:58:30,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:30,307 INFO L333 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, 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;@2e08331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:30,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-31 21:58:30,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:58:30,314 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2024-10-31 21:58:30,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:30,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:30,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:30,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-10-31 21:58:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1914228920, now seen corresponding path program 1 times [2024-10-31 21:58:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780330575] [2024-10-31 21:58:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:30,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:30,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780330575] [2024-10-31 21:58:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780330575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:30,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847305208] [2024-10-31 21:58:30,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:30,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:30,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:30,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:30,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 133 [2024-10-31 21:58:30,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 133 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:30,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:30,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 133 [2024-10-31 21:58:30,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:30,717 INFO L124 PetriNetUnfolderBase]: 204/1293 cut-off events. [2024-10-31 21:58:30,717 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2024-10-31 21:58:30,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1293 events. 204/1293 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 10350 event pairs, 204 based on Foata normal form. 405/1565 useless extension candidates. Maximal degree in co-relation 535. Up to 328 conditions per place. [2024-10-31 21:58:30,733 INFO L140 encePairwiseOnDemand]: 120/133 looper letters, 15 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-10-31 21:58:30,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 111 transitions, 284 flow [2024-10-31 21:58:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2024-10-31 21:58:30,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8220551378446115 [2024-10-31 21:58:30,736 INFO L175 Difference]: Start difference. First operand has 133 places, 133 transitions, 294 flow. Second operand 3 states and 328 transitions. [2024-10-31 21:58:30,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 111 transitions, 284 flow [2024-10-31 21:58:30,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 111 transitions, 278 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:30,743 INFO L231 Difference]: Finished difference. Result has 122 places, 111 transitions, 248 flow [2024-10-31 21:58:30,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=122, PETRI_TRANSITIONS=111} [2024-10-31 21:58:30,744 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2024-10-31 21:58:30,745 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 248 flow [2024-10-31 21:58:30,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:30,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:30,746 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:30,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:58:30,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-10-31 21:58:30,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1603526279, now seen corresponding path program 1 times [2024-10-31 21:58:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:30,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369308076] [2024-10-31 21:58:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369308076] [2024-10-31 21:58:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369308076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:30,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138840136] [2024-10-31 21:58:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:30,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 133 [2024-10-31 21:58:30,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 248 flow. Second operand has 3 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) [2024-10-31 21:58:30,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:30,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 133 [2024-10-31 21:58:30,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:31,428 INFO L124 PetriNetUnfolderBase]: 663/2662 cut-off events. [2024-10-31 21:58:31,428 INFO L125 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2024-10-31 21:58:31,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 2662 events. 663/2662 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 24072 event pairs, 423 based on Foata normal form. 0/2270 useless extension candidates. Maximal degree in co-relation 3982. Up to 871 conditions per place. [2024-10-31 21:58:31,459 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 19 selfloop transitions, 9 changer transitions 0/122 dead transitions. [2024-10-31 21:58:31,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 341 flow [2024-10-31 21:58:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2024-10-31 21:58:31,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8395989974937343 [2024-10-31 21:58:31,462 INFO L175 Difference]: Start difference. First operand has 122 places, 111 transitions, 248 flow. Second operand 3 states and 335 transitions. [2024-10-31 21:58:31,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 341 flow [2024-10-31 21:58:31,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:31,470 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 314 flow [2024-10-31 21:58:31,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2024-10-31 21:58:31,471 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -9 predicate places. [2024-10-31 21:58:31,471 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 314 flow [2024-10-31 21:58:31,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2024-10-31 21:58:31,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:31,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:31,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:58:31,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-10-31 21:58:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2024576316, now seen corresponding path program 1 times [2024-10-31 21:58:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:31,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049095] [2024-10-31 21:58:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:31,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049095] [2024-10-31 21:58:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:31,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245867585] [2024-10-31 21:58:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:31,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:31,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:31,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:31,575 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2024-10-31 21:58:31,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:31,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:31,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2024-10-31 21:58:31,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:33,530 INFO L124 PetriNetUnfolderBase]: 3473/10473 cut-off events. [2024-10-31 21:58:33,530 INFO L125 PetriNetUnfolderBase]: For 4344/4807 co-relation queries the response was YES. [2024-10-31 21:58:33,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20430 conditions, 10473 events. 3473/10473 cut-off events. For 4344/4807 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 115717 event pairs, 866 based on Foata normal form. 9/8553 useless extension candidates. Maximal degree in co-relation 10352. Up to 3170 conditions per place. [2024-10-31 21:58:33,651 INFO L140 encePairwiseOnDemand]: 117/133 looper letters, 30 selfloop transitions, 18 changer transitions 0/140 dead transitions. [2024-10-31 21:58:33,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 140 transitions, 507 flow [2024-10-31 21:58:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2024-10-31 21:58:33,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8370927318295739 [2024-10-31 21:58:33,653 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 314 flow. Second operand 3 states and 334 transitions. [2024-10-31 21:58:33,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 140 transitions, 507 flow [2024-10-31 21:58:33,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 140 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:33,675 INFO L231 Difference]: Finished difference. Result has 126 places, 137 transitions, 474 flow [2024-10-31 21:58:33,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=126, PETRI_TRANSITIONS=137} [2024-10-31 21:58:33,676 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -7 predicate places. [2024-10-31 21:58:33,676 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 137 transitions, 474 flow [2024-10-31 21:58:33,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:33,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:33,676 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:33,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:58:33,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-10-31 21:58:33,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 127343186, now seen corresponding path program 1 times [2024-10-31 21:58:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:33,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103676158] [2024-10-31 21:58:33,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-31 21:58:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103676158] [2024-10-31 21:58:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103676158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:33,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229769203] [2024-10-31 21:58:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:33,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:33,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 133 [2024-10-31 21:58:33,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 137 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2024-10-31 21:58:33,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:33,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 133 [2024-10-31 21:58:33,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:35,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([535] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][123], [130#true, 42#L691-2true, 132#true, 134#true, 149#true, Black: 141#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 146#(= |#race~s~0| 0), Black: 144#true, 85#$Ultimate##0true, 128#true, 76#L691-1true, 103#L698-6true, 58#L691-2true]) [2024-10-31 21:58:35,110 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-31 21:58:35,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-31 21:58:35,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-31 21:58:35,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-31 21:58:35,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([481] L690-2-->L690-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet4#1_3| |v_#race~s~0_1|) InVars {thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} OutVars{#race~s~0=|v_#race~s~0_1|, thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[#race~s~0][131], [130#true, 42#L691-2true, 132#true, 32#L690-3true, 134#true, 149#true, Black: 141#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 4#L691true, Black: 146#(= |#race~s~0| 0), 128#true, 103#L698-6true, 58#L691-2true, 144#true]) [2024-10-31 21:58:35,924 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-31 21:58:35,924 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 21:58:35,924 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 21:58:35,924 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 21:58:36,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([535] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][123], [130#true, 42#L691-2true, 132#true, 134#true, 149#true, 52#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 141#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 146#(= |#race~s~0| 0), Black: 144#true, 21#L691-2true, 76#L691-1true, 128#true, 103#L698-6true]) [2024-10-31 21:58:36,378 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-31 21:58:36,378 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 21:58:36,378 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 21:58:36,378 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 21:58:36,624 INFO L124 PetriNetUnfolderBase]: 6448/18051 cut-off events. [2024-10-31 21:58:36,624 INFO L125 PetriNetUnfolderBase]: For 20948/26710 co-relation queries the response was YES. [2024-10-31 21:58:36,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43814 conditions, 18051 events. 6448/18051 cut-off events. For 20948/26710 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 212215 event pairs, 1485 based on Foata normal form. 94/14777 useless extension candidates. Maximal degree in co-relation 22242. Up to 6312 conditions per place. [2024-10-31 21:58:36,965 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 35 selfloop transitions, 26 changer transitions 0/161 dead transitions. [2024-10-31 21:58:36,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 161 transitions, 750 flow [2024-10-31 21:58:36,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2024-10-31 21:58:36,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8370927318295739 [2024-10-31 21:58:36,967 INFO L175 Difference]: Start difference. First operand has 126 places, 137 transitions, 474 flow. Second operand 3 states and 334 transitions. [2024-10-31 21:58:36,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 161 transitions, 750 flow [2024-10-31 21:58:36,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 161 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:36,998 INFO L231 Difference]: Finished difference. Result has 128 places, 159 transitions, 708 flow [2024-10-31 21:58:36,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=128, PETRI_TRANSITIONS=159} [2024-10-31 21:58:36,999 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -5 predicate places. [2024-10-31 21:58:36,999 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 159 transitions, 708 flow [2024-10-31 21:58:37,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2024-10-31 21:58:37,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:37,000 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:37,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:58:37,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-10-31 21:58:37,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1283197327, now seen corresponding path program 1 times [2024-10-31 21:58:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:37,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851784486] [2024-10-31 21:58:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:37,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:58:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:37,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:58:37,028 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:58:37,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-31 21:58:37,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-31 21:58:37,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-31 21:58:37,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-31 21:58:37,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-31 21:58:37,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-31 21:58:37,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-31 21:58:37,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-31 21:58:37,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-31 21:58:37,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-31 21:58:37,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-31 21:58:37,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-31 21:58:37,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:58:37,031 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-31 21:58:37,032 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 21:58:37,032 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-31 21:58:37,064 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:58:37,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 159 transitions, 358 flow [2024-10-31 21:58:37,089 INFO L124 PetriNetUnfolderBase]: 16/204 cut-off events. [2024-10-31 21:58:37,089 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-31 21:58:37,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 204 events. 16/204 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 581 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 182. Up to 12 conditions per place. [2024-10-31 21:58:37,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 159 transitions, 358 flow [2024-10-31 21:58:37,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 159 transitions, 358 flow [2024-10-31 21:58:37,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:37,098 INFO L333 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, 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;@2e08331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:37,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-31 21:58:37,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:58:37,099 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2024-10-31 21:58:37,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:37,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:37,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:37,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-31 21:58:37,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash 926384695, now seen corresponding path program 1 times [2024-10-31 21:58:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:37,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523859854] [2024-10-31 21:58:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523859854] [2024-10-31 21:58:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523859854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:37,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:37,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476171671] [2024-10-31 21:58:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:37,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:37,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:37,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 159 [2024-10-31 21:58:37,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 159 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2024-10-31 21:58:37,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:37,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 159 [2024-10-31 21:58:37,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:37,969 INFO L124 PetriNetUnfolderBase]: 852/4101 cut-off events. [2024-10-31 21:58:37,970 INFO L125 PetriNetUnfolderBase]: For 2359/2359 co-relation queries the response was YES. [2024-10-31 21:58:37,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5996 conditions, 4101 events. 852/4101 cut-off events. For 2359/2359 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 41533 event pairs, 852 based on Foata normal form. 1458/5156 useless extension candidates. Maximal degree in co-relation 1821. Up to 1219 conditions per place. [2024-10-31 21:58:38,028 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 18 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-10-31 21:58:38,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 346 flow [2024-10-31 21:58:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2024-10-31 21:58:38,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8238993710691824 [2024-10-31 21:58:38,031 INFO L175 Difference]: Start difference. First operand has 159 places, 159 transitions, 358 flow. Second operand 3 states and 393 transitions. [2024-10-31 21:58:38,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 346 flow [2024-10-31 21:58:38,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 133 transitions, 334 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:38,038 INFO L231 Difference]: Finished difference. Result has 146 places, 133 transitions, 298 flow [2024-10-31 21:58:38,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=146, PETRI_TRANSITIONS=133} [2024-10-31 21:58:38,040 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -13 predicate places. [2024-10-31 21:58:38,040 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 133 transitions, 298 flow [2024-10-31 21:58:38,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2024-10-31 21:58:38,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:38,041 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:38,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:58:38,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-31 21:58:38,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash 921114961, now seen corresponding path program 1 times [2024-10-31 21:58:38,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:38,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395781669] [2024-10-31 21:58:38,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:38,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395781669] [2024-10-31 21:58:38,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395781669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:38,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071043932] [2024-10-31 21:58:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:38,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:38,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:38,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 159 [2024-10-31 21:58:38,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 133 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2024-10-31 21:58:38,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:38,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 159 [2024-10-31 21:58:38,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:39,609 INFO L124 PetriNetUnfolderBase]: 2754/9017 cut-off events. [2024-10-31 21:58:39,609 INFO L125 PetriNetUnfolderBase]: For 2346/2346 co-relation queries the response was YES. [2024-10-31 21:58:39,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13902 conditions, 9017 events. 2754/9017 cut-off events. For 2346/2346 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 96646 event pairs, 1834 based on Foata normal form. 0/7833 useless extension candidates. Maximal degree in co-relation 13874. Up to 3392 conditions per place. [2024-10-31 21:58:39,751 INFO L140 encePairwiseOnDemand]: 147/159 looper letters, 23 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2024-10-31 21:58:39,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 414 flow [2024-10-31 21:58:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2024-10-31 21:58:39,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8406708595387841 [2024-10-31 21:58:39,756 INFO L175 Difference]: Start difference. First operand has 146 places, 133 transitions, 298 flow. Second operand 3 states and 401 transitions. [2024-10-31 21:58:39,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 414 flow [2024-10-31 21:58:39,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 147 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:39,769 INFO L231 Difference]: Finished difference. Result has 148 places, 143 transitions, 380 flow [2024-10-31 21:58:39,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=148, PETRI_TRANSITIONS=143} [2024-10-31 21:58:39,770 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -11 predicate places. [2024-10-31 21:58:39,771 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 143 transitions, 380 flow [2024-10-31 21:58:39,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2024-10-31 21:58:39,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:39,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:39,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:58:39,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-31 21:58:39,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 390417330, now seen corresponding path program 1 times [2024-10-31 21:58:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533066927] [2024-10-31 21:58:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:39,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:39,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533066927] [2024-10-31 21:58:39,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533066927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:39,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651779329] [2024-10-31 21:58:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:39,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:39,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:39,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:39,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 159 [2024-10-31 21:58:39,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 143 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2024-10-31 21:58:39,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:39,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 159 [2024-10-31 21:58:39,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:49,610 INFO L124 PetriNetUnfolderBase]: 27487/65434 cut-off events. [2024-10-31 21:58:49,610 INFO L125 PetriNetUnfolderBase]: For 30252/32362 co-relation queries the response was YES. [2024-10-31 21:58:49,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136463 conditions, 65434 events. 27487/65434 cut-off events. For 30252/32362 co-relation queries the response was YES. Maximal size of possible extension queue 2810. Compared 825642 event pairs, 7606 based on Foata normal form. 25/52941 useless extension candidates. Maximal degree in co-relation 77342. Up to 22303 conditions per place. [2024-10-31 21:58:50,671 INFO L140 encePairwiseOnDemand]: 139/159 looper letters, 38 selfloop transitions, 23 changer transitions 0/170 dead transitions. [2024-10-31 21:58:50,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 170 transitions, 628 flow [2024-10-31 21:58:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2024-10-31 21:58:50,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8343815513626834 [2024-10-31 21:58:50,675 INFO L175 Difference]: Start difference. First operand has 148 places, 143 transitions, 380 flow. Second operand 3 states and 398 transitions. [2024-10-31 21:58:50,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 170 transitions, 628 flow [2024-10-31 21:58:51,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 170 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:51,026 INFO L231 Difference]: Finished difference. Result has 150 places, 166 transitions, 586 flow [2024-10-31 21:58:51,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=150, PETRI_TRANSITIONS=166} [2024-10-31 21:58:51,028 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -9 predicate places. [2024-10-31 21:58:51,029 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 166 transitions, 586 flow [2024-10-31 21:58:51,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2024-10-31 21:58:51,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:51,030 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:51,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:58:51,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-31 21:58:51,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1264071502, now seen corresponding path program 1 times [2024-10-31 21:58:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:51,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230065809] [2024-10-31 21:58:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-31 21:58:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230065809] [2024-10-31 21:58:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230065809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:51,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76760260] [2024-10-31 21:58:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:51,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:51,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:51,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:51,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 159 [2024-10-31 21:58:51,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 166 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2024-10-31 21:58:51,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:51,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 159 [2024-10-31 21:58:51,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:53,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([619] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][134], [130#L698-6true, 154#true, 172#(= |#race~s~0| 0), Black: 167#(= |#race~s~0| |thr1Thread1of5ForFork0_#t~nondet4#1|), 159#true, 152#true, Black: 170#true, 158#true, 51#L691-2true, 156#true, 35#$Ultimate##0true, 175#true, 46#L691-1true, 142#L691-2true]) [2024-10-31 21:58:53,621 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-31 21:58:53,621 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-31 21:58:53,621 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-31 21:58:53,621 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-31 21:58:54,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([619] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][134], [130#L698-6true, 154#true, 172#(= |#race~s~0| 0), Black: 167#(= |#race~s~0| |thr1Thread1of5ForFork0_#t~nondet4#1|), 152#true, Black: 170#true, 158#true, 51#L691-2true, 115#$Ultimate##0true, 156#true, 35#$Ultimate##0true, 160#true, 175#true, 46#L691-1true, 142#L691-2true]) [2024-10-31 21:58:54,897 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-31 21:58:54,897 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:54,897 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:54,897 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([619] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][134], [130#L698-6true, 154#true, 172#(= |#race~s~0| 0), Black: 167#(= |#race~s~0| |thr1Thread1of5ForFork0_#t~nondet4#1|), 6#$Ultimate##0true, 108#L691-2true, 152#true, Black: 170#true, 158#true, 115#$Ultimate##0true, 156#true, 175#true, 160#true, 46#L691-1true, 142#L691-2true]) [2024-10-31 21:58:55,183 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,183 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,183 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,184 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([644] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][135], [130#L698-6true, 154#true, 172#(= |#race~s~0| 0), 6#$Ultimate##0true, Black: 167#(= |#race~s~0| |thr1Thread1of5ForFork0_#t~nondet4#1|), 108#L691-2true, 152#true, Black: 170#true, 158#true, 115#$Ultimate##0true, 156#true, 141#L691-1true, 160#true, 175#true, 123#L691-2true]) [2024-10-31 21:58:55,223 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,223 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,224 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 21:58:55,224 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event