./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid-join.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid-join.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 cf6c7ee35ddfe14fba2231760bfacc3f4dc0c9f6bdf06a044d405eacaada9745 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:11:08,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:11:08,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:11:08,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:11:08,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:11:08,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:11:08,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:11:08,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:11:08,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:11:08,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:11:08,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:11:08,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:11:08,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:11:08,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:08,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:08,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:11:08,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:11:08,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:11:08,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:11:08,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:11:08,982 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> cf6c7ee35ddfe14fba2231760bfacc3f4dc0c9f6bdf06a044d405eacaada9745 [2025-04-29 11:11:09,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:11:09,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:11:09,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:11:09,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:11:09,244 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:11:09,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid-join.c [2025-04-29 11:11:10,558 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541a2bb87/230c20db14d24e8593c611f0dc8a3e29/FLAG3b06e8a91 [2025-04-29 11:11:10,729 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:11:10,729 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid-join.c [2025-04-29 11:11:10,730 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:10,730 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:10,734 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541a2bb87/230c20db14d24e8593c611f0dc8a3e29/FLAG3b06e8a91 [2025-04-29 11:11:11,760 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541a2bb87/230c20db14d24e8593c611f0dc8a3e29 [2025-04-29 11:11:11,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:11:11,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:11:11,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:11,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:11:11,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:11:11,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:11,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a47cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11, skipping insertion in model container [2025-04-29 11:11:11,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:11,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:11:11,912 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:11,919 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:11:11,938 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:11,952 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:11:11,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11 WrapperNode [2025-04-29 11:11:11,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:11,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:11,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:11:11,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:11:11,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:11,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:11,984 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2025-04-29 11:11:11,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:11,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:11:11,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:11:11,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:11:11,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:11,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:11,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:11,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:12,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:12,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:12,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:12,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:12,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:12,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:11:12,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:11:12,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:11:12,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:11:12,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (1/1) ... [2025-04-29 11:11:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:12,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:11:12,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:11:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:11:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:11:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:11:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:11:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:11:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:11:12,077 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:11:12,148 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:11:12,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:11:12,372 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:11:12,373 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:11:12,389 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:11:12,390 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:11:12,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:12 BoogieIcfgContainer [2025-04-29 11:11:12,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:11:12,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:11:12,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:11:12,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:11:12,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:11:11" (1/3) ... [2025-04-29 11:11:12,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6b4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:12, skipping insertion in model container [2025-04-29 11:11:12,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:11" (2/3) ... [2025-04-29 11:11:12,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6b4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:12, skipping insertion in model container [2025-04-29 11:11:12,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:12" (3/3) ... [2025-04-29 11:11:12,398 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.c [2025-04-29 11:11:12,407 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:11:12,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid-join.c that has 2 procedures, 113 locations, 114 edges, 1 initial locations, 2 loop locations, and 7 error locations. [2025-04-29 11:11:12,408 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:11:12,461 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:11:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 115 transitions, 237 flow [2025-04-29 11:11:12,542 INFO L116 PetriNetUnfolderBase]: 2/166 cut-off events. [2025-04-29 11:11:12,544 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:11:12,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 166 events. 2/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 75. Up to 3 conditions per place. [2025-04-29 11:11:12,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 115 transitions, 237 flow [2025-04-29 11:11:12,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 115 transitions, 237 flow [2025-04-29 11:11:12,557 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:12,566 INFO L340 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;@13efceb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:12,566 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:11:12,575 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:12,576 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:12,576 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:12,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:12,576 INFO L206 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] [2025-04-29 11:11:12,577 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:12,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash 825213231, now seen corresponding path program 1 times [2025-04-29 11:11:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:12,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691252033] [2025-04-29 11:11:12,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:12,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:12,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:12,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:12,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:12,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:12,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691252033] [2025-04-29 11:11:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691252033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:12,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:12,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789627473] [2025-04-29 11:11:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:12,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:12,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:12,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:12,739 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 115 [2025-04-29 11:11:12,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 115 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2025-04-29 11:11:12,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:12,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 115 [2025-04-29 11:11:12,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:12,824 INFO L116 PetriNetUnfolderBase]: 8/208 cut-off events. [2025-04-29 11:11:12,825 INFO L117 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-04-29 11:11:12,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 208 events. 8/208 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 526 event pairs, 1 based on Foata normal form. 1/186 useless extension candidates. Maximal degree in co-relation 142. Up to 16 conditions per place. [2025-04-29 11:11:12,827 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 8 selfloop transitions, 3 changer transitions 2/118 dead transitions. [2025-04-29 11:11:12,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 118 transitions, 267 flow [2025-04-29 11:11:12,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-04-29 11:11:12,841 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9623188405797102 [2025-04-29 11:11:12,842 INFO L175 Difference]: Start difference. First operand has 116 places, 115 transitions, 237 flow. Second operand 3 states and 332 transitions. [2025-04-29 11:11:12,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 118 transitions, 267 flow [2025-04-29 11:11:12,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:12,850 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 255 flow [2025-04-29 11:11:12,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2025-04-29 11:11:12,856 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 4 predicate places. [2025-04-29 11:11:12,856 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 255 flow [2025-04-29 11:11:12,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2025-04-29 11:11:12,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:12,858 INFO L206 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] [2025-04-29 11:11:12,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:11:12,859 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:12,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1807188987, now seen corresponding path program 1 times [2025-04-29 11:11:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:12,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921403188] [2025-04-29 11:11:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:12,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:12,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:12,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:12,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:13,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921403188] [2025-04-29 11:11:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921403188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:13,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:13,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:13,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968347416] [2025-04-29 11:11:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:13,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:13,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:13,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:13,141 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-04-29 11:11:13,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 115 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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) [2025-04-29 11:11:13,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:13,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-04-29 11:11:13,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:13,208 INFO L116 PetriNetUnfolderBase]: 17/297 cut-off events. [2025-04-29 11:11:13,209 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-29 11:11:13,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 297 events. 17/297 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1047 event pairs, 7 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 285. Up to 49 conditions per place. [2025-04-29 11:11:13,210 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 15 selfloop transitions, 2 changer transitions 5/122 dead transitions. [2025-04-29 11:11:13,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 313 flow [2025-04-29 11:11:13,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2025-04-29 11:11:13,213 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8942028985507247 [2025-04-29 11:11:13,213 INFO L175 Difference]: Start difference. First operand has 120 places, 115 transitions, 255 flow. Second operand 6 states and 617 transitions. [2025-04-29 11:11:13,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 313 flow [2025-04-29 11:11:13,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:13,215 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 267 flow [2025-04-29 11:11:13,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2025-04-29 11:11:13,216 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 10 predicate places. [2025-04-29 11:11:13,216 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 267 flow [2025-04-29 11:11:13,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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) [2025-04-29 11:11:13,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:13,217 INFO L206 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] [2025-04-29 11:11:13,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:11:13,217 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:13,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash -175420118, now seen corresponding path program 1 times [2025-04-29 11:11:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:13,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221605100] [2025-04-29 11:11:13,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:13,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:11:13,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:11:13,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:13,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:13,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221605100] [2025-04-29 11:11:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221605100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:13,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261215503] [2025-04-29 11:11:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:13,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:13,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:13,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:13,744 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 115 [2025-04-29 11:11:13,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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) [2025-04-29 11:11:13,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:13,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 115 [2025-04-29 11:11:13,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:13,832 INFO L116 PetriNetUnfolderBase]: 46/416 cut-off events. [2025-04-29 11:11:13,833 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:11:13,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 416 events. 46/416 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1938 event pairs, 35 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 510. Up to 117 conditions per place. [2025-04-29 11:11:13,843 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 36 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2025-04-29 11:11:13,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 122 transitions, 363 flow [2025-04-29 11:11:13,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2025-04-29 11:11:13,846 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7565217391304347 [2025-04-29 11:11:13,846 INFO L175 Difference]: Start difference. First operand has 126 places, 115 transitions, 267 flow. Second operand 6 states and 522 transitions. [2025-04-29 11:11:13,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 122 transitions, 363 flow [2025-04-29 11:11:13,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 349 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:13,850 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 261 flow [2025-04-29 11:11:13,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2025-04-29 11:11:13,851 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 6 predicate places. [2025-04-29 11:11:13,851 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 261 flow [2025-04-29 11:11:13,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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) [2025-04-29 11:11:13,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:13,851 INFO L206 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:13,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:11:13,851 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:13,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1460308198, now seen corresponding path program 1 times [2025-04-29 11:11:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:13,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347912217] [2025-04-29 11:11:13,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:13,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:13,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:13,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:13,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:14,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347912217] [2025-04-29 11:11:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347912217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:14,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769299006] [2025-04-29 11:11:14,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:14,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:14,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:14,254 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2025-04-29 11:11:14,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 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) [2025-04-29 11:11:14,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:14,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2025-04-29 11:11:14,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:14,334 INFO L116 PetriNetUnfolderBase]: 46/340 cut-off events. [2025-04-29 11:11:14,334 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-29 11:11:14,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 340 events. 46/340 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1575 event pairs, 5 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 405. Up to 112 conditions per place. [2025-04-29 11:11:14,336 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 34 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2025-04-29 11:11:14,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 121 transitions, 353 flow [2025-04-29 11:11:14,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2025-04-29 11:11:14,338 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7710144927536232 [2025-04-29 11:11:14,338 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 261 flow. Second operand 6 states and 532 transitions. [2025-04-29 11:11:14,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 121 transitions, 353 flow [2025-04-29 11:11:14,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 343 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:14,340 INFO L231 Difference]: Finished difference. Result has 121 places, 113 transitions, 259 flow [2025-04-29 11:11:14,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=121, PETRI_TRANSITIONS=113} [2025-04-29 11:11:14,341 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 5 predicate places. [2025-04-29 11:11:14,341 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 113 transitions, 259 flow [2025-04-29 11:11:14,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 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) [2025-04-29 11:11:14,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:14,342 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:14,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:11:14,342 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:14,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1444824070, now seen corresponding path program 1 times [2025-04-29 11:11:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:14,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272694041] [2025-04-29 11:11:14,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:14,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:11:14,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:11:14,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:14,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:14,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272694041] [2025-04-29 11:11:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272694041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:14,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:14,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377913363] [2025-04-29 11:11:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:14,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:14,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:14,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:14,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 115 [2025-04-29 11:11:14,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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) [2025-04-29 11:11:14,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:14,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 115 [2025-04-29 11:11:14,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:14,424 INFO L116 PetriNetUnfolderBase]: 5/212 cut-off events. [2025-04-29 11:11:14,425 INFO L117 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2025-04-29 11:11:14,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 212 events. 5/212 cut-off events. For 18/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 595 event pairs, 3 based on Foata normal form. 1/198 useless extension candidates. Maximal degree in co-relation 212. Up to 25 conditions per place. [2025-04-29 11:11:14,425 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 8 selfloop transitions, 4 changer transitions 3/116 dead transitions. [2025-04-29 11:11:14,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 116 transitions, 295 flow [2025-04-29 11:11:14,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2025-04-29 11:11:14,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9449275362318841 [2025-04-29 11:11:14,427 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 259 flow. Second operand 3 states and 326 transitions. [2025-04-29 11:11:14,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 116 transitions, 295 flow [2025-04-29 11:11:14,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 116 transitions, 285 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:14,429 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 271 flow [2025-04-29 11:11:14,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2025-04-29 11:11:14,430 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 4 predicate places. [2025-04-29 11:11:14,430 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 271 flow [2025-04-29 11:11:14,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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) [2025-04-29 11:11:14,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:14,430 INFO L206 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, 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] [2025-04-29 11:11:14,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:11:14,430 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:14,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1122806871, now seen corresponding path program 1 times [2025-04-29 11:11:14,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:14,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065608951] [2025-04-29 11:11:14,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:14,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:11:14,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:11:14,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:14,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:14,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065608951] [2025-04-29 11:11:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065608951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612264942] [2025-04-29 11:11:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:14,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:14,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:14,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:14,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2025-04-29 11:11:14,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 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) [2025-04-29 11:11:14,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:14,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2025-04-29 11:11:14,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:14,949 INFO L116 PetriNetUnfolderBase]: 33/402 cut-off events. [2025-04-29 11:11:14,949 INFO L117 PetriNetUnfolderBase]: For 66/69 co-relation queries the response was YES. [2025-04-29 11:11:14,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 402 events. 33/402 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1798 event pairs, 23 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 511. Up to 79 conditions per place. [2025-04-29 11:11:14,951 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 31 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2025-04-29 11:11:14,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 119 transitions, 355 flow [2025-04-29 11:11:14,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2025-04-29 11:11:14,952 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7855072463768116 [2025-04-29 11:11:14,952 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 271 flow. Second operand 6 states and 542 transitions. [2025-04-29 11:11:14,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 119 transitions, 355 flow [2025-04-29 11:11:14,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 119 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:14,954 INFO L231 Difference]: Finished difference. Result has 121 places, 111 transitions, 269 flow [2025-04-29 11:11:14,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=121, PETRI_TRANSITIONS=111} [2025-04-29 11:11:14,959 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 5 predicate places. [2025-04-29 11:11:14,959 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 111 transitions, 269 flow [2025-04-29 11:11:14,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 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) [2025-04-29 11:11:14,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:14,959 INFO L206 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, 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] [2025-04-29 11:11:14,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:11:14,959 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:14,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1842826435, now seen corresponding path program 1 times [2025-04-29 11:11:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:14,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742594606] [2025-04-29 11:11:14,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:14,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:14,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:14,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:14,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:11:15,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:15,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742594606] [2025-04-29 11:11:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742594606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:15,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:15,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:15,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782693853] [2025-04-29 11:11:15,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:15,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:15,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:15,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:15,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:15,137 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 115 [2025-04-29 11:11:15,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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) [2025-04-29 11:11:15,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:15,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 115 [2025-04-29 11:11:15,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:15,186 INFO L116 PetriNetUnfolderBase]: 10/234 cut-off events. [2025-04-29 11:11:15,186 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-29 11:11:15,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 234 events. 10/234 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 599 event pairs, 0 based on Foata normal form. 3/229 useless extension candidates. Maximal degree in co-relation 205. Up to 23 conditions per place. [2025-04-29 11:11:15,187 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 13 selfloop transitions, 5 changer transitions 9/112 dead transitions. [2025-04-29 11:11:15,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 112 transitions, 301 flow [2025-04-29 11:11:15,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2025-04-29 11:11:15,189 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2025-04-29 11:11:15,189 INFO L175 Difference]: Start difference. First operand has 121 places, 111 transitions, 269 flow. Second operand 6 states and 610 transitions. [2025-04-29 11:11:15,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 112 transitions, 301 flow [2025-04-29 11:11:15,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 277 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-04-29 11:11:15,191 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 223 flow [2025-04-29 11:11:15,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2025-04-29 11:11:15,193 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 0 predicate places. [2025-04-29 11:11:15,193 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 223 flow [2025-04-29 11:11:15,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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) [2025-04-29 11:11:15,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:15,194 INFO L206 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, 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] [2025-04-29 11:11:15,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:11:15,195 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:15,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1798556792, now seen corresponding path program 1 times [2025-04-29 11:11:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:15,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269014860] [2025-04-29 11:11:15,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:15,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:15,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:11:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:15,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269014860] [2025-04-29 11:11:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269014860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:15,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:15,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489411594] [2025-04-29 11:11:15,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:15,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:15,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:15,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:15,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:15,611 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2025-04-29 11:11:15,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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) [2025-04-29 11:11:15,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:15,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2025-04-29 11:11:15,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:15,672 INFO L116 PetriNetUnfolderBase]: 28/295 cut-off events. [2025-04-29 11:11:15,672 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:11:15,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 295 events. 28/295 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1043 event pairs, 18 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 300. Up to 60 conditions per place. [2025-04-29 11:11:15,673 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 0 changer transitions 38/106 dead transitions. [2025-04-29 11:11:15,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 293 flow [2025-04-29 11:11:15,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 581 transitions. [2025-04-29 11:11:15,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8420289855072464 [2025-04-29 11:11:15,675 INFO L175 Difference]: Start difference. First operand has 116 places, 99 transitions, 223 flow. Second operand 6 states and 581 transitions. [2025-04-29 11:11:15,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 293 flow [2025-04-29 11:11:15,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 285 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:15,676 INFO L231 Difference]: Finished difference. Result has 107 places, 68 transitions, 148 flow [2025-04-29 11:11:15,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=107, PETRI_TRANSITIONS=68} [2025-04-29 11:11:15,677 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -9 predicate places. [2025-04-29 11:11:15,677 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 68 transitions, 148 flow [2025-04-29 11:11:15,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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) [2025-04-29 11:11:15,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:15,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-04-29 11:11:15,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:15,678 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:15,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1435035993, now seen corresponding path program 1 times [2025-04-29 11:11:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:15,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000208730] [2025-04-29 11:11:15,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:15,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:15,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:15,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:15,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:15,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:15,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:15,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:15,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:15,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:15,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:15,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:15,746 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:15,747 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:11:15,748 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:11:15,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:15,748 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:15,751 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:15,751 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:11:15,767 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:11:15,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 282 flow [2025-04-29 11:11:15,792 INFO L116 PetriNetUnfolderBase]: 4/297 cut-off events. [2025-04-29 11:11:15,792 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:15,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 297 events. 4/297 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 568 event pairs, 0 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 168. Up to 6 conditions per place. [2025-04-29 11:11:15,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 282 flow [2025-04-29 11:11:15,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 133 transitions, 282 flow [2025-04-29 11:11:15,795 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:15,796 INFO L340 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;@13efceb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:15,796 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-29 11:11:15,798 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:15,798 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:15,798 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:15,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:15,798 INFO L206 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] [2025-04-29 11:11:15,798 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:15,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1950929551, now seen corresponding path program 1 times [2025-04-29 11:11:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:15,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632429603] [2025-04-29 11:11:15,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:15,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:15,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:15,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:15,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:15,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632429603] [2025-04-29 11:11:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632429603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:15,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:15,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455679522] [2025-04-29 11:11:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:15,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:15,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:15,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:15,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 133 [2025-04-29 11:11:15,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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) [2025-04-29 11:11:15,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:15,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 133 [2025-04-29 11:11:15,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:15,907 INFO L116 PetriNetUnfolderBase]: 119/874 cut-off events. [2025-04-29 11:11:15,907 INFO L117 PetriNetUnfolderBase]: For 60/103 co-relation queries the response was YES. [2025-04-29 11:11:15,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 874 events. 119/874 cut-off events. For 60/103 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4754 event pairs, 50 based on Foata normal form. 1/769 useless extension candidates. Maximal degree in co-relation 837. Up to 139 conditions per place. [2025-04-29 11:11:15,912 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 16 selfloop transitions, 4 changer transitions 1/139 dead transitions. [2025-04-29 11:11:15,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 334 flow [2025-04-29 11:11:15,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2025-04-29 11:11:15,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.949874686716792 [2025-04-29 11:11:15,913 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 282 flow. Second operand 3 states and 379 transitions. [2025-04-29 11:11:15,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 334 flow [2025-04-29 11:11:15,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:15,915 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 308 flow [2025-04-29 11:11:15,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2025-04-29 11:11:15,916 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 4 predicate places. [2025-04-29 11:11:15,916 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 308 flow [2025-04-29 11:11:15,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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) [2025-04-29 11:11:15,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:15,916 INFO L206 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] [2025-04-29 11:11:15,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:15,917 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:15,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1969407493, now seen corresponding path program 1 times [2025-04-29 11:11:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:15,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955046377] [2025-04-29 11:11:15,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:15,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:15,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:15,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:15,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:15,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955046377] [2025-04-29 11:11:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955046377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:15,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:15,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970433369] [2025-04-29 11:11:15,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:15,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:15,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:15,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:16,015 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133 [2025-04-29 11:11:16,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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) [2025-04-29 11:11:16,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:16,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133 [2025-04-29 11:11:16,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:16,133 INFO L116 PetriNetUnfolderBase]: 189/1370 cut-off events. [2025-04-29 11:11:16,133 INFO L117 PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES. [2025-04-29 11:11:16,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1370 events. 189/1370 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9514 event pairs, 131 based on Foata normal form. 1/1252 useless extension candidates. Maximal degree in co-relation 1269. Up to 314 conditions per place. [2025-04-29 11:11:16,141 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 20 selfloop transitions, 2 changer transitions 5/142 dead transitions. [2025-04-29 11:11:16,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 378 flow [2025-04-29 11:11:16,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2025-04-29 11:11:16,144 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8847117794486216 [2025-04-29 11:11:16,144 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 308 flow. Second operand 6 states and 706 transitions. [2025-04-29 11:11:16,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 378 flow [2025-04-29 11:11:16,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 142 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:16,148 INFO L231 Difference]: Finished difference. Result has 145 places, 135 transitions, 322 flow [2025-04-29 11:11:16,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=145, PETRI_TRANSITIONS=135} [2025-04-29 11:11:16,149 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 10 predicate places. [2025-04-29 11:11:16,149 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 135 transitions, 322 flow [2025-04-29 11:11:16,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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) [2025-04-29 11:11:16,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:16,150 INFO L206 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] [2025-04-29 11:11:16,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:16,150 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:16,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash 934953903, now seen corresponding path program 1 times [2025-04-29 11:11:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:16,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157602215] [2025-04-29 11:11:16,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:16,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:11:16,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:11:16,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:16,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:16,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:16,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157602215] [2025-04-29 11:11:16,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157602215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:16,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:16,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825039670] [2025-04-29 11:11:16,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:16,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:16,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:16,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:16,434 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 133 [2025-04-29 11:11:16,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 135 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:16,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:16,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 133 [2025-04-29 11:11:16,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:16,633 INFO L116 PetriNetUnfolderBase]: 448/2409 cut-off events. [2025-04-29 11:11:16,633 INFO L117 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-04-29 11:11:16,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2409 events. 448/2409 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19929 event pairs, 342 based on Foata normal form. 0/2142 useless extension candidates. Maximal degree in co-relation 3406. Up to 657 conditions per place. [2025-04-29 11:11:16,644 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 49 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2025-04-29 11:11:16,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 150 transitions, 460 flow [2025-04-29 11:11:16,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2025-04-29 11:11:16,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7744360902255639 [2025-04-29 11:11:16,646 INFO L175 Difference]: Start difference. First operand has 145 places, 135 transitions, 322 flow. Second operand 6 states and 618 transitions. [2025-04-29 11:11:16,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 150 transitions, 460 flow [2025-04-29 11:11:16,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 150 transitions, 448 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:16,648 INFO L231 Difference]: Finished difference. Result has 142 places, 134 transitions, 318 flow [2025-04-29 11:11:16,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=142, PETRI_TRANSITIONS=134} [2025-04-29 11:11:16,649 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 7 predicate places. [2025-04-29 11:11:16,649 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 318 flow [2025-04-29 11:11:16,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:16,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:16,650 INFO L206 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:16,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:16,650 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:16,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1507680181, now seen corresponding path program 1 times [2025-04-29 11:11:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:16,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744428310] [2025-04-29 11:11:16,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:16,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:16,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:16,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:16,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:16,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:16,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744428310] [2025-04-29 11:11:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744428310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:16,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189271234] [2025-04-29 11:11:16,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:16,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:16,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:16,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:16,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 133 [2025-04-29 11:11:16,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 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) [2025-04-29 11:11:16,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:16,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 133 [2025-04-29 11:11:16,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:17,068 INFO L116 PetriNetUnfolderBase]: 443/2230 cut-off events. [2025-04-29 11:11:17,068 INFO L117 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-04-29 11:11:17,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3292 conditions, 2230 events. 443/2230 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 18789 event pairs, 186 based on Foata normal form. 0/2013 useless extension candidates. Maximal degree in co-relation 1114. Up to 629 conditions per place. [2025-04-29 11:11:17,078 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 46 selfloop transitions, 5 changer transitions 0/149 dead transitions. [2025-04-29 11:11:17,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 149 transitions, 450 flow [2025-04-29 11:11:17,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2025-04-29 11:11:17,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7869674185463659 [2025-04-29 11:11:17,080 INFO L175 Difference]: Start difference. First operand has 142 places, 134 transitions, 318 flow. Second operand 6 states and 628 transitions. [2025-04-29 11:11:17,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 149 transitions, 450 flow [2025-04-29 11:11:17,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 149 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:17,083 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 316 flow [2025-04-29 11:11:17,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2025-04-29 11:11:17,084 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places. [2025-04-29 11:11:17,084 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 316 flow [2025-04-29 11:11:17,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 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) [2025-04-29 11:11:17,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:17,085 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:17,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:11:17,085 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:17,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash -642879953, now seen corresponding path program 1 times [2025-04-29 11:11:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:17,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684573125] [2025-04-29 11:11:17,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:17,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:11:17,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:11:17,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:17,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:17,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684573125] [2025-04-29 11:11:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684573125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:17,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:17,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:17,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206497385] [2025-04-29 11:11:17,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:17,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:17,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:17,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:17,120 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 133 [2025-04-29 11:11:17,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2025-04-29 11:11:17,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:17,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 133 [2025-04-29 11:11:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:17,201 INFO L116 PetriNetUnfolderBase]: 165/1185 cut-off events. [2025-04-29 11:11:17,201 INFO L117 PetriNetUnfolderBase]: For 165/332 co-relation queries the response was YES. [2025-04-29 11:11:17,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1185 events. 165/1185 cut-off events. For 165/332 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8177 event pairs, 88 based on Foata normal form. 3/1055 useless extension candidates. Maximal degree in co-relation 1425. Up to 269 conditions per place. [2025-04-29 11:11:17,206 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 19 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2025-04-29 11:11:17,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 400 flow [2025-04-29 11:11:17,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-04-29 11:11:17,207 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2025-04-29 11:11:17,207 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 316 flow. Second operand 3 states and 375 transitions. [2025-04-29 11:11:17,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 400 flow [2025-04-29 11:11:17,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 142 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:17,209 INFO L231 Difference]: Finished difference. Result has 140 places, 138 transitions, 362 flow [2025-04-29 11:11:17,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=140, PETRI_TRANSITIONS=138} [2025-04-29 11:11:17,210 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 5 predicate places. [2025-04-29 11:11:17,210 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 138 transitions, 362 flow [2025-04-29 11:11:17,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2025-04-29 11:11:17,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:17,210 INFO L206 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, 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] [2025-04-29 11:11:17,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:11:17,211 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:17,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 106386270, now seen corresponding path program 1 times [2025-04-29 11:11:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:17,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462503048] [2025-04-29 11:11:17,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:17,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:11:17,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:11:17,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:17,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:17,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462503048] [2025-04-29 11:11:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462503048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017187630] [2025-04-29 11:11:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:17,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:17,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:17,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:17,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2025-04-29 11:11:17,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 138 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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) [2025-04-29 11:11:17,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:17,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2025-04-29 11:11:17,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:17,798 INFO L116 PetriNetUnfolderBase]: 463/2594 cut-off events. [2025-04-29 11:11:17,798 INFO L117 PetriNetUnfolderBase]: For 405/460 co-relation queries the response was YES. [2025-04-29 11:11:17,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 2594 events. 463/2594 cut-off events. For 405/460 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 22457 event pairs, 251 based on Foata normal form. 3/2377 useless extension candidates. Maximal degree in co-relation 3257. Up to 490 conditions per place. [2025-04-29 11:11:17,810 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 43 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2025-04-29 11:11:17,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 486 flow [2025-04-29 11:11:17,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2025-04-29 11:11:17,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7994987468671679 [2025-04-29 11:11:17,812 INFO L175 Difference]: Start difference. First operand has 140 places, 138 transitions, 362 flow. Second operand 6 states and 638 transitions. [2025-04-29 11:11:17,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 486 flow [2025-04-29 11:11:17,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:17,817 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 354 flow [2025-04-29 11:11:17,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2025-04-29 11:11:17,818 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places. [2025-04-29 11:11:17,818 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 354 flow [2025-04-29 11:11:17,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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) [2025-04-29 11:11:17,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:17,818 INFO L206 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, 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] [2025-04-29 11:11:17,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:11:17,819 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:17,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 523053720, now seen corresponding path program 1 times [2025-04-29 11:11:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:17,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717113883] [2025-04-29 11:11:17,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:17,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:17,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:17,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:17,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:17,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717113883] [2025-04-29 11:11:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717113883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222601967] [2025-04-29 11:11:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:17,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:17,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:17,987 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 133 [2025-04-29 11:11:17,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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) [2025-04-29 11:11:17,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:17,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 133 [2025-04-29 11:11:17,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:18,090 INFO L116 PetriNetUnfolderBase]: 145/1367 cut-off events. [2025-04-29 11:11:18,090 INFO L117 PetriNetUnfolderBase]: For 141/169 co-relation queries the response was YES. [2025-04-29 11:11:18,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 1367 events. 145/1367 cut-off events. For 141/169 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9326 event pairs, 75 based on Foata normal form. 15/1302 useless extension candidates. Maximal degree in co-relation 1057. Up to 195 conditions per place. [2025-04-29 11:11:18,096 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 26 selfloop transitions, 6 changer transitions 3/149 dead transitions. [2025-04-29 11:11:18,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 149 transitions, 454 flow [2025-04-29 11:11:18,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2025-04-29 11:11:18,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8872180451127819 [2025-04-29 11:11:18,098 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 354 flow. Second operand 6 states and 708 transitions. [2025-04-29 11:11:18,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 149 transitions, 454 flow [2025-04-29 11:11:18,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 149 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:18,100 INFO L231 Difference]: Finished difference. Result has 143 places, 137 transitions, 364 flow [2025-04-29 11:11:18,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=143, PETRI_TRANSITIONS=137} [2025-04-29 11:11:18,101 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 8 predicate places. [2025-04-29 11:11:18,101 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 137 transitions, 364 flow [2025-04-29 11:11:18,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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) [2025-04-29 11:11:18,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:18,102 INFO L206 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, 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] [2025-04-29 11:11:18,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:11:18,102 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:18,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 478784077, now seen corresponding path program 1 times [2025-04-29 11:11:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:18,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601149597] [2025-04-29 11:11:18,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:18,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:18,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:18,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:18,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601149597] [2025-04-29 11:11:18,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601149597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:18,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:18,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404349421] [2025-04-29 11:11:18,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:18,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:18,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:18,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:18,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:18,398 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2025-04-29 11:11:18,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 137 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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) [2025-04-29 11:11:18,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:18,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2025-04-29 11:11:18,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:18,554 INFO L116 PetriNetUnfolderBase]: 329/1879 cut-off events. [2025-04-29 11:11:18,554 INFO L117 PetriNetUnfolderBase]: For 141/176 co-relation queries the response was YES. [2025-04-29 11:11:18,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1879 events. 329/1879 cut-off events. For 141/176 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14479 event pairs, 186 based on Foata normal form. 0/1750 useless extension candidates. Maximal degree in co-relation 2178. Up to 364 conditions per place. [2025-04-29 11:11:18,562 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 36 selfloop transitions, 5 changer transitions 1/152 dead transitions. [2025-04-29 11:11:18,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 152 transitions, 476 flow [2025-04-29 11:11:18,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2025-04-29 11:11:18,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.849624060150376 [2025-04-29 11:11:18,564 INFO L175 Difference]: Start difference. First operand has 143 places, 137 transitions, 364 flow. Second operand 6 states and 678 transitions. [2025-04-29 11:11:18,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 152 transitions, 476 flow [2025-04-29 11:11:18,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 152 transitions, 468 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:18,566 INFO L231 Difference]: Finished difference. Result has 144 places, 135 transitions, 360 flow [2025-04-29 11:11:18,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2025-04-29 11:11:18,567 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 9 predicate places. [2025-04-29 11:11:18,567 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 360 flow [2025-04-29 11:11:18,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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) [2025-04-29 11:11:18,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:18,567 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:18,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:11:18,567 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:18,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1228977243, now seen corresponding path program 1 times [2025-04-29 11:11:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:18,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933517532] [2025-04-29 11:11:18,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:18,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:11:18,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:11:18,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:18,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:18,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933517532] [2025-04-29 11:11:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933517532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939323287] [2025-04-29 11:11:18,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:18,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:18,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:18,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:18,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 133 [2025-04-29 11:11:18,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2025-04-29 11:11:18,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:18,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 133 [2025-04-29 11:11:18,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:18,677 INFO L116 PetriNetUnfolderBase]: 56/875 cut-off events. [2025-04-29 11:11:18,677 INFO L117 PetriNetUnfolderBase]: For 186/414 co-relation queries the response was YES. [2025-04-29 11:11:18,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 875 events. 56/875 cut-off events. For 186/414 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5336 event pairs, 30 based on Foata normal form. 2/851 useless extension candidates. Maximal degree in co-relation 1138. Up to 119 conditions per place. [2025-04-29 11:11:18,681 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 19 selfloop transitions, 7 changer transitions 1/142 dead transitions. [2025-04-29 11:11:18,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 142 transitions, 437 flow [2025-04-29 11:11:18,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-04-29 11:11:18,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2025-04-29 11:11:18,683 INFO L175 Difference]: Start difference. First operand has 144 places, 135 transitions, 360 flow. Second operand 3 states and 374 transitions. [2025-04-29 11:11:18,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 142 transitions, 437 flow [2025-04-29 11:11:18,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 142 transitions, 427 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:18,687 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 400 flow [2025-04-29 11:11:18,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-04-29 11:11:18,688 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 8 predicate places. [2025-04-29 11:11:18,688 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 400 flow [2025-04-29 11:11:18,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2025-04-29 11:11:18,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:18,688 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:18,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:11:18,689 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:18,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2032116199, now seen corresponding path program 1 times [2025-04-29 11:11:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:18,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037006110] [2025-04-29 11:11:18,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:18,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-29 11:11:18,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-29 11:11:18,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:18,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:18,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037006110] [2025-04-29 11:11:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037006110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:18,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945278783] [2025-04-29 11:11:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:18,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:18,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:18,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 133 [2025-04-29 11:11:18,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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) [2025-04-29 11:11:18,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:18,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 133 [2025-04-29 11:11:18,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:18,804 INFO L116 PetriNetUnfolderBase]: 12/533 cut-off events. [2025-04-29 11:11:18,804 INFO L117 PetriNetUnfolderBase]: For 113/134 co-relation queries the response was YES. [2025-04-29 11:11:18,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 533 events. 12/533 cut-off events. For 113/134 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2287 event pairs, 2 based on Foata normal form. 4/530 useless extension candidates. Maximal degree in co-relation 550. Up to 24 conditions per place. [2025-04-29 11:11:18,806 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 8 selfloop transitions, 4 changer transitions 4/139 dead transitions. [2025-04-29 11:11:18,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 421 flow [2025-04-29 11:11:18,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-04-29 11:11:18,807 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9598997493734336 [2025-04-29 11:11:18,807 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 400 flow. Second operand 3 states and 383 transitions. [2025-04-29 11:11:18,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 421 flow [2025-04-29 11:11:18,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 409 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:18,809 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 360 flow [2025-04-29 11:11:18,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2025-04-29 11:11:18,810 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 8 predicate places. [2025-04-29 11:11:18,810 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 360 flow [2025-04-29 11:11:18,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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) [2025-04-29 11:11:18,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:18,810 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-04-29 11:11:18,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:11:18,810 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-29 11:11:18,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1509028114, now seen corresponding path program 1 times [2025-04-29 11:11:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:18,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548392790] [2025-04-29 11:11:18,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:18,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-29 11:11:18,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-29 11:11:18,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:18,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:18,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-29 11:11:18,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-29 11:11:18,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:18,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:18,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:18,868 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:18,868 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-04-29 11:11:18,868 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-04-29 11:11:18,868 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-04-29 11:11:18,868 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-04-29 11:11:18,868 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-04-29 11:11:18,868 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-04-29 11:11:18,868 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-04-29 11:11:18,869 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-04-29 11:11:18,869 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-04-29 11:11:18,869 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-04-29 11:11:18,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:11:18,869 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:18,870 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:18,871 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:11:18,885 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-29 11:11:18,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 151 transitions, 329 flow [2025-04-29 11:11:18,924 INFO L116 PetriNetUnfolderBase]: 9/511 cut-off events. [2025-04-29 11:11:18,924 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:11:18,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 511 events. 9/511 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1300 event pairs, 1 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 305. Up to 12 conditions per place. [2025-04-29 11:11:18,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 151 transitions, 329 flow [2025-04-29 11:11:18,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 151 transitions, 329 flow [2025-04-29 11:11:18,930 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:18,931 INFO L340 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;@13efceb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:18,931 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-29 11:11:18,933 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:18,933 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:18,933 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:18,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:18,933 INFO L206 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] [2025-04-29 11:11:18,933 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:18,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 710145455, now seen corresponding path program 1 times [2025-04-29 11:11:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:18,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425682177] [2025-04-29 11:11:18,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:18,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:18,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:18,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:18,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:18,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425682177] [2025-04-29 11:11:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425682177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521634581] [2025-04-29 11:11:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:18,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:18,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:18,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:18,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:18,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-04-29 11:11:18,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2025-04-29 11:11:18,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:18,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-04-29 11:11:18,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:19,302 INFO L116 PetriNetUnfolderBase]: 1071/4743 cut-off events. [2025-04-29 11:11:19,302 INFO L117 PetriNetUnfolderBase]: For 467/854 co-relation queries the response was YES. [2025-04-29 11:11:19,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6658 conditions, 4743 events. 1071/4743 cut-off events. For 467/854 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 42169 event pairs, 542 based on Foata normal form. 1/4215 useless extension candidates. Maximal degree in co-relation 5220. Up to 1110 conditions per place. [2025-04-29 11:11:19,321 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 23 selfloop transitions, 5 changer transitions 1/160 dead transitions. [2025-04-29 11:11:19,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 160 transitions, 403 flow [2025-04-29 11:11:19,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2025-04-29 11:11:19,323 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9403973509933775 [2025-04-29 11:11:19,323 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 329 flow. Second operand 3 states and 426 transitions. [2025-04-29 11:11:19,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 160 transitions, 403 flow [2025-04-29 11:11:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 160 transitions, 403 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:19,325 INFO L231 Difference]: Finished difference. Result has 158 places, 153 transitions, 363 flow [2025-04-29 11:11:19,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=158, PETRI_TRANSITIONS=153} [2025-04-29 11:11:19,326 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 4 predicate places. [2025-04-29 11:11:19,326 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 363 flow [2025-04-29 11:11:19,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2025-04-29 11:11:19,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:19,326 INFO L206 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] [2025-04-29 11:11:19,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:11:19,326 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:19,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash -718162939, now seen corresponding path program 1 times [2025-04-29 11:11:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:19,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645617180] [2025-04-29 11:11:19,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:19,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:19,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:19,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:19,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:19,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:19,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645617180] [2025-04-29 11:11:19,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645617180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:19,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:19,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705858258] [2025-04-29 11:11:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:19,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:19,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:19,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:19,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:19,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 151 [2025-04-29 11:11:19,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2025-04-29 11:11:19,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:19,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 151 [2025-04-29 11:11:19,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:19,942 INFO L116 PetriNetUnfolderBase]: 1404/6857 cut-off events. [2025-04-29 11:11:19,942 INFO L117 PetriNetUnfolderBase]: For 443/458 co-relation queries the response was YES. [2025-04-29 11:11:19,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9755 conditions, 6857 events. 1404/6857 cut-off events. For 443/458 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 66710 event pairs, 1086 based on Foata normal form. 1/6142 useless extension candidates. Maximal degree in co-relation 6121. Up to 1847 conditions per place. [2025-04-29 11:11:19,971 INFO L140 encePairwiseOnDemand]: 143/151 looper letters, 24 selfloop transitions, 2 changer transitions 5/161 dead transitions. [2025-04-29 11:11:19,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 161 transitions, 441 flow [2025-04-29 11:11:19,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2025-04-29 11:11:19,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8763796909492274 [2025-04-29 11:11:19,973 INFO L175 Difference]: Start difference. First operand has 158 places, 153 transitions, 363 flow. Second operand 6 states and 794 transitions. [2025-04-29 11:11:19,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 161 transitions, 441 flow [2025-04-29 11:11:19,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 161 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:19,978 INFO L231 Difference]: Finished difference. Result has 164 places, 154 transitions, 375 flow [2025-04-29 11:11:19,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=164, PETRI_TRANSITIONS=154} [2025-04-29 11:11:19,979 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 10 predicate places. [2025-04-29 11:11:19,979 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 154 transitions, 375 flow [2025-04-29 11:11:19,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2025-04-29 11:11:19,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:19,979 INFO L206 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] [2025-04-29 11:11:19,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:11:19,979 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:19,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:19,980 INFO L85 PathProgramCache]: Analyzing trace with hash -775350714, now seen corresponding path program 1 times [2025-04-29 11:11:19,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:19,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087226084] [2025-04-29 11:11:19,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:19,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:11:19,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:11:19,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:19,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:20,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087226084] [2025-04-29 11:11:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087226084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016954946] [2025-04-29 11:11:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:20,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:20,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:20,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:20,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 151 [2025-04-29 11:11:20,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 154 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:20,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:20,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 151 [2025-04-29 11:11:20,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:21,139 INFO L116 PetriNetUnfolderBase]: 3152/13174 cut-off events. [2025-04-29 11:11:21,139 INFO L117 PetriNetUnfolderBase]: For 507/508 co-relation queries the response was YES. [2025-04-29 11:11:21,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19318 conditions, 13174 events. 3152/13174 cut-off events. For 507/508 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 142866 event pairs, 2459 based on Foata normal form. 0/11514 useless extension candidates. Maximal degree in co-relation 19209. Up to 3699 conditions per place. [2025-04-29 11:11:21,197 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 61 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-04-29 11:11:21,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 177 transitions, 553 flow [2025-04-29 11:11:21,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2025-04-29 11:11:21,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7880794701986755 [2025-04-29 11:11:21,198 INFO L175 Difference]: Start difference. First operand has 164 places, 154 transitions, 375 flow. Second operand 6 states and 714 transitions. [2025-04-29 11:11:21,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 177 transitions, 553 flow [2025-04-29 11:11:21,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 177 transitions, 541 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:21,203 INFO L231 Difference]: Finished difference. Result has 161 places, 153 transitions, 371 flow [2025-04-29 11:11:21,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=161, PETRI_TRANSITIONS=153} [2025-04-29 11:11:21,203 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 7 predicate places. [2025-04-29 11:11:21,203 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 153 transitions, 371 flow [2025-04-29 11:11:21,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:21,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:21,204 INFO L206 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:21,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:11:21,204 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:21,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 63475842, now seen corresponding path program 1 times [2025-04-29 11:11:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:21,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811528224] [2025-04-29 11:11:21,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:21,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:21,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:21,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:21,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:21,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811528224] [2025-04-29 11:11:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811528224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:21,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140726100] [2025-04-29 11:11:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:21,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:21,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:21,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:21,505 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 151 [2025-04-29 11:11:21,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 153 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 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) [2025-04-29 11:11:21,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:21,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 151 [2025-04-29 11:11:21,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:22,570 INFO L116 PetriNetUnfolderBase]: 3180/13221 cut-off events. [2025-04-29 11:11:22,571 INFO L117 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-04-29 11:11:22,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19258 conditions, 13221 events. 3180/13221 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 143932 event pairs, 1611 based on Foata normal form. 0/11500 useless extension candidates. Maximal degree in co-relation 12511. Up to 3627 conditions per place. [2025-04-29 11:11:22,636 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 58 selfloop transitions, 5 changer transitions 0/176 dead transitions. [2025-04-29 11:11:22,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 176 transitions, 543 flow [2025-04-29 11:11:22,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2025-04-29 11:11:22,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7991169977924945 [2025-04-29 11:11:22,638 INFO L175 Difference]: Start difference. First operand has 161 places, 153 transitions, 371 flow. Second operand 6 states and 724 transitions. [2025-04-29 11:11:22,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 176 transitions, 543 flow [2025-04-29 11:11:22,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 176 transitions, 533 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:22,641 INFO L231 Difference]: Finished difference. Result has 160 places, 152 transitions, 369 flow [2025-04-29 11:11:22,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=160, PETRI_TRANSITIONS=152} [2025-04-29 11:11:22,642 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 6 predicate places. [2025-04-29 11:11:22,642 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 152 transitions, 369 flow [2025-04-29 11:11:22,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 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) [2025-04-29 11:11:22,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:22,642 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:22,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:11:22,642 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:22,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1071248918, now seen corresponding path program 1 times [2025-04-29 11:11:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:22,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433244813] [2025-04-29 11:11:22,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:22,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:11:22,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:11:22,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:22,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433244813] [2025-04-29 11:11:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433244813] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:22,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115889918] [2025-04-29 11:11:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:22,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:22,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:22,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:22,687 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 151 [2025-04-29 11:11:22,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 152 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2025-04-29 11:11:22,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:22,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 151 [2025-04-29 11:11:22,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:23,372 INFO L116 PetriNetUnfolderBase]: 1743/7664 cut-off events. [2025-04-29 11:11:23,372 INFO L117 PetriNetUnfolderBase]: For 1814/3268 co-relation queries the response was YES. [2025-04-29 11:11:23,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11994 conditions, 7664 events. 1743/7664 cut-off events. For 1814/3268 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 78531 event pairs, 967 based on Foata normal form. 9/6723 useless extension candidates. Maximal degree in co-relation 10027. Up to 2242 conditions per place. [2025-04-29 11:11:23,397 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 29 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2025-04-29 11:11:23,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 167 transitions, 503 flow [2025-04-29 11:11:23,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2025-04-29 11:11:23,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9359823399558499 [2025-04-29 11:11:23,398 INFO L175 Difference]: Start difference. First operand has 160 places, 152 transitions, 369 flow. Second operand 3 states and 424 transitions. [2025-04-29 11:11:23,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 167 transitions, 503 flow [2025-04-29 11:11:23,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 167 transitions, 493 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:23,400 INFO L231 Difference]: Finished difference. Result has 159 places, 159 transitions, 435 flow [2025-04-29 11:11:23,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=159, PETRI_TRANSITIONS=159} [2025-04-29 11:11:23,401 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 5 predicate places. [2025-04-29 11:11:23,401 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 159 transitions, 435 flow [2025-04-29 11:11:23,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2025-04-29 11:11:23,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:23,402 INFO L206 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, 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] [2025-04-29 11:11:23,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:11:23,402 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:23,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1109864357, now seen corresponding path program 1 times [2025-04-29 11:11:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:23,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565592353] [2025-04-29 11:11:23,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:23,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:11:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:11:23,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:23,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:23,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565592353] [2025-04-29 11:11:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565592353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:23,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:23,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:23,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870356761] [2025-04-29 11:11:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:23,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:23,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:23,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:23,671 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 151 [2025-04-29 11:11:23,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 159 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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) [2025-04-29 11:11:23,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:23,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 151 [2025-04-29 11:11:23,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:24,655 INFO L116 PetriNetUnfolderBase]: 3779/14518 cut-off events. [2025-04-29 11:11:24,655 INFO L117 PetriNetUnfolderBase]: For 2224/2886 co-relation queries the response was YES. [2025-04-29 11:11:24,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23785 conditions, 14518 events. 3779/14518 cut-off events. For 2224/2886 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 163879 event pairs, 1873 based on Foata normal form. 17/12968 useless extension candidates. Maximal degree in co-relation 18569. Up to 2793 conditions per place. [2025-04-29 11:11:24,708 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 55 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2025-04-29 11:11:24,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 181 transitions, 599 flow [2025-04-29 11:11:24,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2025-04-29 11:11:24,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8101545253863135 [2025-04-29 11:11:24,710 INFO L175 Difference]: Start difference. First operand has 159 places, 159 transitions, 435 flow. Second operand 6 states and 734 transitions. [2025-04-29 11:11:24,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 181 transitions, 599 flow [2025-04-29 11:11:24,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 181 transitions, 581 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:24,719 INFO L231 Difference]: Finished difference. Result has 160 places, 157 transitions, 423 flow [2025-04-29 11:11:24,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=423, PETRI_PLACES=160, PETRI_TRANSITIONS=157} [2025-04-29 11:11:24,719 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 6 predicate places. [2025-04-29 11:11:24,719 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 157 transitions, 423 flow [2025-04-29 11:11:24,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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) [2025-04-29 11:11:24,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:24,720 INFO L206 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, 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] [2025-04-29 11:11:24,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:11:24,720 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:24,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1106393505, now seen corresponding path program 1 times [2025-04-29 11:11:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:24,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685972625] [2025-04-29 11:11:24,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:24,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:24,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:24,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:24,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:24,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685972625] [2025-04-29 11:11:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685972625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:24,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:24,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:24,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680964920] [2025-04-29 11:11:24,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:24,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:24,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:24,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:24,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:24,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 151 [2025-04-29 11:11:24,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 157 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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) [2025-04-29 11:11:24,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:24,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 151 [2025-04-29 11:11:24,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:25,407 INFO L116 PetriNetUnfolderBase]: 1355/7920 cut-off events. [2025-04-29 11:11:25,407 INFO L117 PetriNetUnfolderBase]: For 1018/1269 co-relation queries the response was YES. [2025-04-29 11:11:25,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11947 conditions, 7920 events. 1355/7920 cut-off events. For 1018/1269 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 82094 event pairs, 732 based on Foata normal form. 66/7341 useless extension candidates. Maximal degree in co-relation 6729. Up to 1304 conditions per place. [2025-04-29 11:11:25,430 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 38 selfloop transitions, 6 changer transitions 0/176 dead transitions. [2025-04-29 11:11:25,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 176 transitions, 560 flow [2025-04-29 11:11:25,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2025-04-29 11:11:25,431 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8841059602649006 [2025-04-29 11:11:25,431 INFO L175 Difference]: Start difference. First operand has 160 places, 157 transitions, 423 flow. Second operand 6 states and 801 transitions. [2025-04-29 11:11:25,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 176 transitions, 560 flow [2025-04-29 11:11:25,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 176 transitions, 548 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:25,435 INFO L231 Difference]: Finished difference. Result has 162 places, 159 transitions, 439 flow [2025-04-29 11:11:25,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=162, PETRI_TRANSITIONS=159} [2025-04-29 11:11:25,435 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 8 predicate places. [2025-04-29 11:11:25,435 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 159 transitions, 439 flow [2025-04-29 11:11:25,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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) [2025-04-29 11:11:25,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:25,436 INFO L206 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, 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] [2025-04-29 11:11:25,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:11:25,436 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:25,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1843296780, now seen corresponding path program 1 times [2025-04-29 11:11:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:25,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803975968] [2025-04-29 11:11:25,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:25,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:25,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:25,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:25,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:25,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803975968] [2025-04-29 11:11:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803975968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:25,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:25,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554934386] [2025-04-29 11:11:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:25,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:25,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:25,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:25,698 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 151 [2025-04-29 11:11:25,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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) [2025-04-29 11:11:25,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:25,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 151 [2025-04-29 11:11:25,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:26,540 INFO L116 PetriNetUnfolderBase]: 2701/10577 cut-off events. [2025-04-29 11:11:26,540 INFO L117 PetriNetUnfolderBase]: For 977/1390 co-relation queries the response was YES. [2025-04-29 11:11:26,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17023 conditions, 10577 events. 2701/10577 cut-off events. For 977/1390 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 112747 event pairs, 1410 based on Foata normal form. 6/9530 useless extension candidates. Maximal degree in co-relation 12583. Up to 2113 conditions per place. [2025-04-29 11:11:26,584 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 48 selfloop transitions, 5 changer transitions 0/182 dead transitions. [2025-04-29 11:11:26,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 182 transitions, 591 flow [2025-04-29 11:11:26,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 774 transitions. [2025-04-29 11:11:26,585 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8543046357615894 [2025-04-29 11:11:26,585 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 439 flow. Second operand 6 states and 774 transitions. [2025-04-29 11:11:26,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 182 transitions, 591 flow [2025-04-29 11:11:26,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 182 transitions, 583 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:26,589 INFO L231 Difference]: Finished difference. Result has 163 places, 158 transitions, 439 flow [2025-04-29 11:11:26,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=163, PETRI_TRANSITIONS=158} [2025-04-29 11:11:26,591 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 9 predicate places. [2025-04-29 11:11:26,591 INFO L485 AbstractCegarLoop]: Abstraction has has 163 places, 158 transitions, 439 flow [2025-04-29 11:11:26,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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) [2025-04-29 11:11:26,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:26,592 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:26,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:11:26,592 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:26,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash 161052549, now seen corresponding path program 1 times [2025-04-29 11:11:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:26,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388446518] [2025-04-29 11:11:26,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:26,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:11:26,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:11:26,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:26,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:26,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388446518] [2025-04-29 11:11:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388446518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:26,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:26,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027584445] [2025-04-29 11:11:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:26,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:26,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:26,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:26,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:26,646 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 151 [2025-04-29 11:11:26,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 158 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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) [2025-04-29 11:11:26,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:26,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 151 [2025-04-29 11:11:26,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:27,361 INFO L116 PetriNetUnfolderBase]: 1086/6180 cut-off events. [2025-04-29 11:11:27,361 INFO L117 PetriNetUnfolderBase]: For 2861/4492 co-relation queries the response was YES. [2025-04-29 11:11:27,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 6180 events. 1086/6180 cut-off events. For 2861/4492 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 65951 event pairs, 589 based on Foata normal form. 13/5730 useless extension candidates. Maximal degree in co-relation 9427. Up to 1450 conditions per place. [2025-04-29 11:11:27,399 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 31 selfloop transitions, 13 changer transitions 0/174 dead transitions. [2025-04-29 11:11:27,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 174 transitions, 600 flow [2025-04-29 11:11:27,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2025-04-29 11:11:27,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9337748344370861 [2025-04-29 11:11:27,400 INFO L175 Difference]: Start difference. First operand has 163 places, 158 transitions, 439 flow. Second operand 3 states and 423 transitions. [2025-04-29 11:11:27,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 174 transitions, 600 flow [2025-04-29 11:11:27,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 174 transitions, 590 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:27,405 INFO L231 Difference]: Finished difference. Result has 162 places, 167 transitions, 547 flow [2025-04-29 11:11:27,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=162, PETRI_TRANSITIONS=167} [2025-04-29 11:11:27,405 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 8 predicate places. [2025-04-29 11:11:27,405 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 167 transitions, 547 flow [2025-04-29 11:11:27,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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) [2025-04-29 11:11:27,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:27,406 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:27,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:11:27,406 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:27,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash 20428185, now seen corresponding path program 1 times [2025-04-29 11:11:27,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:27,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446801051] [2025-04-29 11:11:27,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:27,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-29 11:11:27,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-29 11:11:27,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:27,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446801051] [2025-04-29 11:11:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446801051] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:27,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917261828] [2025-04-29 11:11:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:27,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:27,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:27,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:27,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 151 [2025-04-29 11:11:27,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 167 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:27,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:27,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 151 [2025-04-29 11:11:27,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:27,704 INFO L116 PetriNetUnfolderBase]: 117/1863 cut-off events. [2025-04-29 11:11:27,704 INFO L117 PetriNetUnfolderBase]: For 763/933 co-relation queries the response was YES. [2025-04-29 11:11:27,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2878 conditions, 1863 events. 117/1863 cut-off events. For 763/933 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 14333 event pairs, 43 based on Foata normal form. 24/1810 useless extension candidates. Maximal degree in co-relation 2277. Up to 144 conditions per place. [2025-04-29 11:11:27,712 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 12 selfloop transitions, 6 changer transitions 0/162 dead transitions. [2025-04-29 11:11:27,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 520 flow [2025-04-29 11:11:27,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2025-04-29 11:11:27,713 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9536423841059603 [2025-04-29 11:11:27,713 INFO L175 Difference]: Start difference. First operand has 162 places, 167 transitions, 547 flow. Second operand 3 states and 432 transitions. [2025-04-29 11:11:27,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 520 flow [2025-04-29 11:11:27,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 162 transitions, 506 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:27,717 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 451 flow [2025-04-29 11:11:27,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-04-29 11:11:27,720 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 8 predicate places. [2025-04-29 11:11:27,720 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 451 flow [2025-04-29 11:11:27,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:27,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:27,720 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2025-04-29 11:11:27,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:11:27,721 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:27,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1914487947, now seen corresponding path program 1 times [2025-04-29 11:11:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:27,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174465343] [2025-04-29 11:11:27,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:27,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-04-29 11:11:27,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-04-29 11:11:27,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:27,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174465343] [2025-04-29 11:11:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174465343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:27,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:27,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:27,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935408787] [2025-04-29 11:11:27,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:27,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:27,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:27,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:27,782 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 151 [2025-04-29 11:11:27,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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) [2025-04-29 11:11:27,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:27,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 151 [2025-04-29 11:11:27,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:28,015 INFO L116 PetriNetUnfolderBase]: 203/2140 cut-off events. [2025-04-29 11:11:28,015 INFO L117 PetriNetUnfolderBase]: For 1457/1923 co-relation queries the response was YES. [2025-04-29 11:11:28,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 2140 events. 203/2140 cut-off events. For 1457/1923 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17716 event pairs, 134 based on Foata normal form. 3/1991 useless extension candidates. Maximal degree in co-relation 3042. Up to 435 conditions per place. [2025-04-29 11:11:28,023 INFO L140 encePairwiseOnDemand]: 146/151 looper letters, 25 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-04-29 11:11:28,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 533 flow [2025-04-29 11:11:28,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2025-04-29 11:11:28,024 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9183222958057395 [2025-04-29 11:11:28,024 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 451 flow. Second operand 3 states and 416 transitions. [2025-04-29 11:11:28,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 533 flow [2025-04-29 11:11:28,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 162 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:11:28,027 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 485 flow [2025-04-29 11:11:28,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-04-29 11:11:28,028 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, 11 predicate places. [2025-04-29 11:11:28,028 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 485 flow [2025-04-29 11:11:28,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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) [2025-04-29 11:11:28,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:28,028 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-04-29 11:11:28,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:11:28,028 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:28,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:28,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1357450690, now seen corresponding path program 1 times [2025-04-29 11:11:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:28,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511602879] [2025-04-29 11:11:28,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:28,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-29 11:11:28,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-29 11:11:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:28,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:28,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-29 11:11:28,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-29 11:11:28,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:28,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:28,124 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:28,124 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-29 11:11:28,124 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-29 11:11:28,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-29 11:11:28,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:11:28,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:28,126 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:28,126 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-29 11:11:28,152 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-29 11:11:28,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 169 transitions, 378 flow [2025-04-29 11:11:28,232 INFO L116 PetriNetUnfolderBase]: 22/893 cut-off events. [2025-04-29 11:11:28,232 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-29 11:11:28,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 893 events. 22/893 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3047 event pairs, 6 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 531. Up to 32 conditions per place. [2025-04-29 11:11:28,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 169 transitions, 378 flow [2025-04-29 11:11:28,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 169 transitions, 378 flow [2025-04-29 11:11:28,236 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:28,237 INFO L340 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;@13efceb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:28,237 INFO L341 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-04-29 11:11:28,239 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:28,239 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:28,239 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:28,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:28,239 INFO L206 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] [2025-04-29 11:11:28,239 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-04-29 11:11:28,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1397828239, now seen corresponding path program 1 times [2025-04-29 11:11:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:28,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14807760] [2025-04-29 11:11:28,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:28,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:28,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:28,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:28,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:28,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14807760] [2025-04-29 11:11:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14807760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:28,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550893766] [2025-04-29 11:11:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:28,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:28,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:28,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:28,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:28,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 169 [2025-04-29 11:11:28,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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) [2025-04-29 11:11:28,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:28,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 169 [2025-04-29 11:11:28,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:30,183 INFO L116 PetriNetUnfolderBase]: 7859/26534 cut-off events. [2025-04-29 11:11:30,183 INFO L117 PetriNetUnfolderBase]: For 2502/5227 co-relation queries the response was YES. [2025-04-29 11:11:30,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38884 conditions, 26534 events. 7859/26534 cut-off events. For 2502/5227 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 305141 event pairs, 4292 based on Foata normal form. 1/23806 useless extension candidates. Maximal degree in co-relation 30851. Up to 7653 conditions per place. [2025-04-29 11:11:30,675 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 30 selfloop transitions, 6 changer transitions 1/181 dead transitions. [2025-04-29 11:11:30,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 181 transitions, 474 flow [2025-04-29 11:11:30,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-04-29 11:11:30,676 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9329388560157791 [2025-04-29 11:11:30,676 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 378 flow. Second operand 3 states and 473 transitions. [2025-04-29 11:11:30,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 181 transitions, 474 flow [2025-04-29 11:11:30,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 181 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:30,679 INFO L231 Difference]: Finished difference. Result has 177 places, 172 transitions, 420 flow [2025-04-29 11:11:30,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2025-04-29 11:11:30,680 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 4 predicate places. [2025-04-29 11:11:30,680 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 420 flow [2025-04-29 11:11:30,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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) [2025-04-29 11:11:30,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:30,680 INFO L206 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] [2025-04-29 11:11:30,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:11:30,680 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-04-29 11:11:30,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1279965691, now seen corresponding path program 1 times [2025-04-29 11:11:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:30,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127131395] [2025-04-29 11:11:30,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:30,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:30,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:30,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:30,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127131395] [2025-04-29 11:11:30,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127131395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:30,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:30,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:30,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893846468] [2025-04-29 11:11:30,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:30,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:30,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:30,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:30,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:30,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 169 [2025-04-29 11:11:30,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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) [2025-04-29 11:11:30,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:30,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 169 [2025-04-29 11:11:30,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,055 INFO L116 PetriNetUnfolderBase]: 8820/34645 cut-off events. [2025-04-29 11:11:34,055 INFO L117 PetriNetUnfolderBase]: For 2371/2468 co-relation queries the response was YES. [2025-04-29 11:11:34,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50997 conditions, 34645 events. 8820/34645 cut-off events. For 2371/2468 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 427337 event pairs, 5739 based on Foata normal form. 1/30069 useless extension candidates. Maximal degree in co-relation 29122. Up to 9926 conditions per place. [2025-04-29 11:11:34,317 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 28 selfloop transitions, 2 changer transitions 5/180 dead transitions. [2025-04-29 11:11:34,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 180 transitions, 506 flow [2025-04-29 11:11:34,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2025-04-29 11:11:34,319 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8698224852071006 [2025-04-29 11:11:34,319 INFO L175 Difference]: Start difference. First operand has 177 places, 172 transitions, 420 flow. Second operand 6 states and 882 transitions. [2025-04-29 11:11:34,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 180 transitions, 506 flow [2025-04-29 11:11:34,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 180 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:34,377 INFO L231 Difference]: Finished difference. Result has 183 places, 173 transitions, 430 flow [2025-04-29 11:11:34,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=183, PETRI_TRANSITIONS=173} [2025-04-29 11:11:34,377 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 10 predicate places. [2025-04-29 11:11:34,377 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 173 transitions, 430 flow [2025-04-29 11:11:34,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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) [2025-04-29 11:11:34,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,378 INFO L206 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] [2025-04-29 11:11:34,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:11:34,378 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-04-29 11:11:34,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1011366673, now seen corresponding path program 1 times [2025-04-29 11:11:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787737646] [2025-04-29 11:11:34,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:11:34,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:11:34,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:34,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787737646] [2025-04-29 11:11:34,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787737646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251193507] [2025-04-29 11:11:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:34,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:34,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 169 [2025-04-29 11:11:34,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 173 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 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) [2025-04-29 11:11:34,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 169 [2025-04-29 11:11:34,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:41,778 INFO L116 PetriNetUnfolderBase]: 20475/70083 cut-off events. [2025-04-29 11:11:41,778 INFO L117 PetriNetUnfolderBase]: For 2766/2782 co-relation queries the response was YES. [2025-04-29 11:11:42,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104953 conditions, 70083 events. 20475/70083 cut-off events. For 2766/2782 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 930757 event pairs, 16401 based on Foata normal form. 0/60300 useless extension candidates. Maximal degree in co-relation 104843. Up to 21481 conditions per place. [2025-04-29 11:11:42,271 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 73 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2025-04-29 11:11:42,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 204 transitions, 648 flow [2025-04-29 11:11:42,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2025-04-29 11:11:42,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7988165680473372 [2025-04-29 11:11:42,273 INFO L175 Difference]: Start difference. First operand has 183 places, 173 transitions, 430 flow. Second operand 6 states and 810 transitions. [2025-04-29 11:11:42,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 204 transitions, 648 flow [2025-04-29 11:11:42,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 204 transitions, 636 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:42,307 INFO L231 Difference]: Finished difference. Result has 180 places, 172 transitions, 426 flow [2025-04-29 11:11:42,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=426, PETRI_PLACES=180, PETRI_TRANSITIONS=172} [2025-04-29 11:11:42,308 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places. [2025-04-29 11:11:42,308 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 172 transitions, 426 flow [2025-04-29 11:11:42,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 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) [2025-04-29 11:11:42,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:42,308 INFO L206 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:42,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:11:42,308 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-04-29 11:11:42,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1878808971, now seen corresponding path program 1 times [2025-04-29 11:11:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:42,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902406278] [2025-04-29 11:11:42,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:42,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:42,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:42,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:42,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:42,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:42,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902406278] [2025-04-29 11:11:42,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902406278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:42,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:42,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:42,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997940576] [2025-04-29 11:11:42,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:42,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:42,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:42,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:42,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:42,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 169 [2025-04-29 11:11:42,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 172 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 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) [2025-04-29 11:11:42,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:42,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 169 [2025-04-29 11:11:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:47,957 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([679] L51-1-->L53: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][77], [170#true, 172#true, Black: 176#true, 44#L53true, 192#true, 31#L27-5true, 198#true, 168#true, 43#L28-3true, 173#true, 121#L27-5true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-29 11:11:47,958 INFO L286 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-04-29 11:11:47,958 INFO L289 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-04-29 11:11:47,958 INFO L289 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-04-29 11:11:47,958 INFO L289 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-04-29 11:11:48,118 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([679] L51-1-->L53: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][77], [170#true, 172#true, Black: 176#true, 44#L53true, 31#L27-5true, 192#true, 168#true, 198#true, 43#L28-3true, 173#true, 121#L27-5true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-29 11:11:48,118 INFO L286 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-04-29 11:11:48,118 INFO L289 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-04-29 11:11:48,118 INFO L289 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-04-29 11:11:48,118 INFO L289 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-04-29 11:11:48,118 INFO L289 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-04-29 11:11:49,477 INFO L116 PetriNetUnfolderBase]: 20522/70456 cut-off events. [2025-04-29 11:11:49,477 INFO L117 PetriNetUnfolderBase]: For 2397/2397 co-relation queries the response was YES. [2025-04-29 11:11:49,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104653 conditions, 70456 events. 20522/70456 cut-off events. For 2397/2397 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 942339 event pairs, 9642 based on Foata normal form. 0/60612 useless extension candidates. Maximal degree in co-relation 69849. Up to 21037 conditions per place. [2025-04-29 11:11:49,868 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 70 selfloop transitions, 5 changer transitions 0/203 dead transitions. [2025-04-29 11:11:49,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 203 transitions, 638 flow [2025-04-29 11:11:49,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2025-04-29 11:11:49,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8086785009861933 [2025-04-29 11:11:49,869 INFO L175 Difference]: Start difference. First operand has 180 places, 172 transitions, 426 flow. Second operand 6 states and 820 transitions. [2025-04-29 11:11:49,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 203 transitions, 638 flow [2025-04-29 11:11:49,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 203 transitions, 628 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:49,874 INFO L231 Difference]: Finished difference. Result has 179 places, 171 transitions, 424 flow [2025-04-29 11:11:49,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=179, PETRI_TRANSITIONS=171} [2025-04-29 11:11:49,875 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places. [2025-04-29 11:11:49,875 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 171 transitions, 424 flow [2025-04-29 11:11:49,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 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) [2025-04-29 11:11:49,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,875 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:49,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-29 11:11:49,875 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-04-29 11:11:49,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash -73368737, now seen corresponding path program 1 times [2025-04-29 11:11:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323724180] [2025-04-29 11:11:49,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:11:49,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:11:49,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:49,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323724180] [2025-04-29 11:11:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323724180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:49,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894309515] [2025-04-29 11:11:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:49,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:49,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:49,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:49,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 169 [2025-04-29 11:11:49,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 171 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2025-04-29 11:11:49,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:49,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 169 [2025-04-29 11:11:49,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:54,780 INFO L116 PetriNetUnfolderBase]: 13833/49298 cut-off events. [2025-04-29 11:11:54,781 INFO L117 PetriNetUnfolderBase]: For 12060/23975 co-relation queries the response was YES. [2025-04-29 11:11:54,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78975 conditions, 49298 events. 13833/49298 cut-off events. For 12060/23975 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 648671 event pairs, 7275 based on Foata normal form. 42/42838 useless extension candidates. Maximal degree in co-relation 30724. Up to 16026 conditions per place. [2025-04-29 11:11:55,079 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 39 selfloop transitions, 11 changer transitions 0/192 dead transitions. [2025-04-29 11:11:55,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 192 transitions, 610 flow [2025-04-29 11:11:55,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-04-29 11:11:55,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9329388560157791 [2025-04-29 11:11:55,080 INFO L175 Difference]: Start difference. First operand has 179 places, 171 transitions, 424 flow. Second operand 3 states and 473 transitions. [2025-04-29 11:11:55,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 192 transitions, 610 flow [2025-04-29 11:11:55,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 192 transitions, 600 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:55,083 INFO L231 Difference]: Finished difference. Result has 178 places, 180 transitions, 510 flow [2025-04-29 11:11:55,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=178, PETRI_TRANSITIONS=180} [2025-04-29 11:11:55,084 INFO L279 CegarLoopForPetriNet]: 173 programPoint places, 5 predicate places. [2025-04-29 11:11:55,084 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 180 transitions, 510 flow [2025-04-29 11:11:55,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2025-04-29 11:11:55,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:55,084 INFO L206 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, 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] [2025-04-29 11:11:55,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-29 11:11:55,084 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-04-29 11:11:55,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1887627390, now seen corresponding path program 1 times [2025-04-29 11:11:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:55,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281574294] [2025-04-29 11:11:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:55,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:11:55,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:11:55,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:55,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:55,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281574294] [2025-04-29 11:11:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281574294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:55,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:55,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199930391] [2025-04-29 11:11:55,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:55,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:55,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:55,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:55,351 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 169 [2025-04-29 11:11:55,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 180 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 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) [2025-04-29 11:11:55,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:55,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 169 [2025-04-29 11:11:55,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand