./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic.i --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/thread-join-array-dynamic.i -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 e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:30:58,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:30:58,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:30:58,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:30:58,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:30:59,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:30:59,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:30:59,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:30:59,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:30:59,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:30:59,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:30:59,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:30:59,011 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:30:59,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:30:59,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:30:59,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:30:59,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:30:59,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:59,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:59,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:59,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:30:59,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:59,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:59,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:59,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:30:59,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:30:59,014 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 -> e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b [2025-04-30 10:30:59,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:30:59,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:30:59,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:30:59,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:30:59,218 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:30:59,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic.i [2025-04-30 10:31:00,491 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b7320f6/1a92653764034133803749243dc643de/FLAGbf170f8df [2025-04-30 10:31:00,796 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:31:00,797 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic.i [2025-04-30 10:31:00,814 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b7320f6/1a92653764034133803749243dc643de/FLAGbf170f8df [2025-04-30 10:31:01,492 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b7320f6/1a92653764034133803749243dc643de [2025-04-30 10:31:01,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:31:01,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:31:01,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:01,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:31:01,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:31:01,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:01,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132b179e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01, skipping insertion in model container [2025-04-30 10:31:01,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:01,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:31:01,849 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:01,860 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:31:01,919 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:01,959 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:31:01,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01 WrapperNode [2025-04-30 10:31:01,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:01,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:01,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:31:01,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:31:01,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:01,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:01,990 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-04-30 10:31:01,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:01,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:31:01,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:31:01,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:31:01,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:01,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:01,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:01,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:02,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:02,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:02,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:02,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:02,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:02,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:31:02,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:31:02,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:31:02,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:31:02,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (1/1) ... [2025-04-30 10:31:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:02,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:31:02,034 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-30 10:31:02,037 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-30 10:31:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:31:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:31:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:31:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:31:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:31:02,053 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:31:02,139 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:31:02,140 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:31:02,284 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:31:02,284 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:31:02,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:31:02,299 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:31:02,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:02 BoogieIcfgContainer [2025-04-30 10:31:02,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:31:02,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:31:02,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:31:02,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:31:02,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:31:01" (1/3) ... [2025-04-30 10:31:02,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38609fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:02, skipping insertion in model container [2025-04-30 10:31:02,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:01" (2/3) ... [2025-04-30 10:31:02,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38609fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:02, skipping insertion in model container [2025-04-30 10:31:02,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:02" (3/3) ... [2025-04-30 10:31:02,308 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i [2025-04-30 10:31:02,318 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:31:02,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic.i that has 2 procedures, 87 locations, 88 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-30 10:31:02,321 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:31:02,360 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:31:02,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 185 flow [2025-04-30 10:31:02,434 INFO L116 PetriNetUnfolderBase]: 2/121 cut-off events. [2025-04-30 10:31:02,438 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:31:02,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 121 events. 2/121 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 60. Up to 3 conditions per place. [2025-04-30 10:31:02,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 185 flow [2025-04-30 10:31:02,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 185 flow [2025-04-30 10:31:02,452 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:02,464 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;@1ace8bd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:02,464 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:31:02,475 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:02,476 INFO L116 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-04-30 10:31:02,476 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:02,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:02,477 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] [2025-04-30 10:31:02,477 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:31:02,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash -9187041, now seen corresponding path program 1 times [2025-04-30 10:31:02,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:02,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746037006] [2025-04-30 10:31:02,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:02,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:31:02,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:31:02,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:02,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:02,686 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-30 10:31:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:02,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746037006] [2025-04-30 10:31:02,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746037006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:02,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175185148] [2025-04-30 10:31:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:02,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:02,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:02,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:02,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:02,724 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 89 [2025-04-30 10:31:02,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-30 10:31:02,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:02,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 89 [2025-04-30 10:31:02,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:02,788 INFO L116 PetriNetUnfolderBase]: 8/163 cut-off events. [2025-04-30 10:31:02,789 INFO L117 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-04-30 10:31:02,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 163 events. 8/163 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 414 event pairs, 1 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2025-04-30 10:31:02,791 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 3 changer transitions 2/92 dead transitions. [2025-04-30 10:31:02,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 215 flow [2025-04-30 10:31:02,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-04-30 10:31:02,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2025-04-30 10:31:02,803 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 185 flow. Second operand 3 states and 254 transitions. [2025-04-30 10:31:02,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 215 flow [2025-04-30 10:31:02,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:02,811 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 203 flow [2025-04-30 10:31:02,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-04-30 10:31:02,816 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-04-30 10:31:02,816 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 203 flow [2025-04-30 10:31:02,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-30 10:31:02,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:02,817 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] [2025-04-30 10:31:02,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:31:02,817 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:31:02,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash -418826439, now seen corresponding path program 1 times [2025-04-30 10:31:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:02,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469474263] [2025-04-30 10:31:02,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:02,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:02,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:02,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:02,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:02,986 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-30 10:31:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:02,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469474263] [2025-04-30 10:31:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469474263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:02,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:02,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171473868] [2025-04-30 10:31:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:02,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:02,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:02,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:03,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 89 [2025-04-30 10:31:03,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:31:03,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:03,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 89 [2025-04-30 10:31:03,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:03,145 INFO L116 PetriNetUnfolderBase]: 17/236 cut-off events. [2025-04-30 10:31:03,145 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-30 10:31:03,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 236 events. 17/236 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 835 event pairs, 1 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 224. Up to 49 conditions per place. [2025-04-30 10:31:03,147 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 15 selfloop transitions, 2 changer transitions 5/96 dead transitions. [2025-04-30 10:31:03,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 261 flow [2025-04-30 10:31:03,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2025-04-30 10:31:03,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8632958801498127 [2025-04-30 10:31:03,149 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 203 flow. Second operand 6 states and 461 transitions. [2025-04-30 10:31:03,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 261 flow [2025-04-30 10:31:03,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:03,151 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 215 flow [2025-04-30 10:31:03,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2025-04-30 10:31:03,152 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 10 predicate places. [2025-04-30 10:31:03,152 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 215 flow [2025-04-30 10:31:03,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:31:03,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:03,153 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] [2025-04-30 10:31:03,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:31:03,153 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:31:03,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2133540115, now seen corresponding path program 1 times [2025-04-30 10:31:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:03,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427688654] [2025-04-30 10:31:03,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:03,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:03,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:03,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:03,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:03,510 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-30 10:31:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:03,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427688654] [2025-04-30 10:31:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427688654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:03,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:03,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288736156] [2025-04-30 10:31:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:03,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:03,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:03,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:03,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:03,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-04-30 10:31:03,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-30 10:31:03,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:03,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-04-30 10:31:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:03,668 INFO L116 PetriNetUnfolderBase]: 30/241 cut-off events. [2025-04-30 10:31:03,668 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-30 10:31:03,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 241 events. 30/241 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 997 event pairs, 5 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 295. Up to 61 conditions per place. [2025-04-30 10:31:03,670 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 24 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-04-30 10:31:03,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 287 flow [2025-04-30 10:31:03,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2025-04-30 10:31:03,673 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.797752808988764 [2025-04-30 10:31:03,673 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 215 flow. Second operand 6 states and 426 transitions. [2025-04-30 10:31:03,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 287 flow [2025-04-30 10:31:03,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 273 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:03,677 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 209 flow [2025-04-30 10:31:03,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-04-30 10:31:03,678 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2025-04-30 10:31:03,678 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 209 flow [2025-04-30 10:31:03,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-30 10:31:03,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:03,679 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] [2025-04-30 10:31:03,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:31:03,679 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:31:03,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1863812927, now seen corresponding path program 1 times [2025-04-30 10:31:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:03,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843272171] [2025-04-30 10:31:03,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:03,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:31:03,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:31:03,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:03,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:03,716 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-30 10:31:03,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:03,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843272171] [2025-04-30 10:31:03,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843272171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:03,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:03,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:03,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024082325] [2025-04-30 10:31:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:03,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:03,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:03,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:03,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:03,728 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 89 [2025-04-30 10:31:03,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-30 10:31:03,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:03,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 89 [2025-04-30 10:31:03,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:03,748 INFO L116 PetriNetUnfolderBase]: 5/169 cut-off events. [2025-04-30 10:31:03,749 INFO L117 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2025-04-30 10:31:03,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 169 events. 5/169 cut-off events. For 18/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 469 event pairs, 3 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 175. Up to 25 conditions per place. [2025-04-30 10:31:03,749 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 4 changer transitions 3/91 dead transitions. [2025-04-30 10:31:03,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 245 flow [2025-04-30 10:31:03,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-04-30 10:31:03,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9288389513108615 [2025-04-30 10:31:03,751 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 209 flow. Second operand 3 states and 248 transitions. [2025-04-30 10:31:03,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 245 flow [2025-04-30 10:31:03,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 235 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:03,753 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 221 flow [2025-04-30 10:31:03,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-04-30 10:31:03,753 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-04-30 10:31:03,753 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 221 flow [2025-04-30 10:31:03,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-30 10:31:03,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:03,754 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-30 10:31:03,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:31:03,754 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:31:03,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1154489115, now seen corresponding path program 1 times [2025-04-30 10:31:03,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:03,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096425218] [2025-04-30 10:31:03,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:03,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:31:03,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:31:03,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:03,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:03,985 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-30 10:31:03,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:03,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096425218] [2025-04-30 10:31:03,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096425218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:03,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:03,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:03,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694033772] [2025-04-30 10:31:03,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:03,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:03,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:03,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:04,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2025-04-30 10:31:04,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:31:04,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:04,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2025-04-30 10:31:04,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:04,142 INFO L116 PetriNetUnfolderBase]: 25/282 cut-off events. [2025-04-30 10:31:04,142 INFO L117 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2025-04-30 10:31:04,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 282 events. 25/282 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1216 event pairs, 15 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2025-04-30 10:31:04,145 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 12 selfloop transitions, 0 changer transitions 20/95 dead transitions. [2025-04-30 10:31:04,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 289 flow [2025-04-30 10:31:04,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 436 transitions. [2025-04-30 10:31:04,147 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8164794007490637 [2025-04-30 10:31:04,147 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 221 flow. Second operand 6 states and 436 transitions. [2025-04-30 10:31:04,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 289 flow [2025-04-30 10:31:04,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:04,149 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 184 flow [2025-04-30 10:31:04,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2025-04-30 10:31:04,153 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-04-30 10:31:04,153 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 184 flow [2025-04-30 10:31:04,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:31:04,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:04,156 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:31:04,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:31:04,157 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:31:04,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash -187091962, now seen corresponding path program 1 times [2025-04-30 10:31:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:04,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523534676] [2025-04-30 10:31:04,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:04,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:31:04,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:31:04,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:04,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:04,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:04,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:31:04,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:31:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:04,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:04,212 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:04,212 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-30 10:31:04,214 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-30 10:31:04,214 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-30 10:31:04,214 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-30 10:31:04,214 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-30 10:31:04,214 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-30 10:31:04,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:31:04,214 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:31:04,216 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:04,216 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:31:04,226 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:31:04,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 107 transitions, 230 flow [2025-04-30 10:31:04,242 INFO L116 PetriNetUnfolderBase]: 4/205 cut-off events. [2025-04-30 10:31:04,242 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:31:04,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 205 events. 4/205 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 123. Up to 6 conditions per place. [2025-04-30 10:31:04,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 107 transitions, 230 flow [2025-04-30 10:31:04,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 107 transitions, 230 flow [2025-04-30 10:31:04,244 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:04,244 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;@1ace8bd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:04,244 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:31:04,247 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:04,247 INFO L116 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-04-30 10:31:04,247 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:04,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:04,248 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] [2025-04-30 10:31:04,248 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:04,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 847901823, now seen corresponding path program 1 times [2025-04-30 10:31:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:04,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190023874] [2025-04-30 10:31:04,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:04,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:31:04,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:31:04,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:04,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:04,267 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-30 10:31:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:04,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190023874] [2025-04-30 10:31:04,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190023874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:04,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:04,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:04,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209335028] [2025-04-30 10:31:04,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:04,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:04,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:04,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:04,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2025-04-30 10:31:04,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-30 10:31:04,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:04,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2025-04-30 10:31:04,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:04,384 INFO L116 PetriNetUnfolderBase]: 119/731 cut-off events. [2025-04-30 10:31:04,384 INFO L117 PetriNetUnfolderBase]: For 58/82 co-relation queries the response was YES. [2025-04-30 10:31:04,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 731 events. 119/731 cut-off events. For 58/82 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4305 event pairs, 50 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2025-04-30 10:31:04,388 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 16 selfloop transitions, 4 changer transitions 1/113 dead transitions. [2025-04-30 10:31:04,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 113 transitions, 282 flow [2025-04-30 10:31:04,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2025-04-30 10:31:04,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9376947040498442 [2025-04-30 10:31:04,389 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 230 flow. Second operand 3 states and 301 transitions. [2025-04-30 10:31:04,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 113 transitions, 282 flow [2025-04-30 10:31:04,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:04,392 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 256 flow [2025-04-30 10:31:04,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-04-30 10:31:04,392 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2025-04-30 10:31:04,392 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 256 flow [2025-04-30 10:31:04,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-30 10:31:04,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:04,393 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] [2025-04-30 10:31:04,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:31:04,393 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:04,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1390145543, now seen corresponding path program 1 times [2025-04-30 10:31:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:04,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506842179] [2025-04-30 10:31:04,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:04,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:04,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:04,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:04,444 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-30 10:31:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:04,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506842179] [2025-04-30 10:31:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506842179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606744302] [2025-04-30 10:31:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:04,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:04,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:04,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:04,510 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107 [2025-04-30 10:31:04,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-30 10:31:04,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:04,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107 [2025-04-30 10:31:04,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:04,659 INFO L116 PetriNetUnfolderBase]: 189/1195 cut-off events. [2025-04-30 10:31:04,660 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-30 10:31:04,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1195 events. 189/1195 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8584 event pairs, 131 based on Foata normal form. 1/1096 useless extension candidates. Maximal degree in co-relation 1094. Up to 314 conditions per place. [2025-04-30 10:31:04,669 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 20 selfloop transitions, 2 changer transitions 5/116 dead transitions. [2025-04-30 10:31:04,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 326 flow [2025-04-30 10:31:04,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2025-04-30 10:31:04,672 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8566978193146417 [2025-04-30 10:31:04,672 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 256 flow. Second operand 6 states and 550 transitions. [2025-04-30 10:31:04,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 326 flow [2025-04-30 10:31:04,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:04,675 INFO L231 Difference]: Finished difference. Result has 119 places, 109 transitions, 270 flow [2025-04-30 10:31:04,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=119, PETRI_TRANSITIONS=109} [2025-04-30 10:31:04,677 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2025-04-30 10:31:04,678 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 109 transitions, 270 flow [2025-04-30 10:31:04,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-30 10:31:04,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:04,678 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] [2025-04-30 10:31:04,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:31:04,678 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:04,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1190108077, now seen corresponding path program 1 times [2025-04-30 10:31:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:04,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210051119] [2025-04-30 10:31:04,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:04,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:04,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:04,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:04,873 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-30 10:31:04,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:04,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210051119] [2025-04-30 10:31:04,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210051119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:04,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:04,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:04,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130589993] [2025-04-30 10:31:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:04,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:04,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:04,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:04,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:04,945 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2025-04-30 10:31:04,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 109 transitions, 270 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-30 10:31:04,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:04,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2025-04-30 10:31:04,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:05,063 INFO L116 PetriNetUnfolderBase]: 298/1282 cut-off events. [2025-04-30 10:31:05,063 INFO L117 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-04-30 10:31:05,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1282 events. 298/1282 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9646 event pairs, 130 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 959. Up to 371 conditions per place. [2025-04-30 10:31:05,070 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 37 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-04-30 10:31:05,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 124 transitions, 384 flow [2025-04-30 10:31:05,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2025-04-30 10:31:05,072 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8130841121495327 [2025-04-30 10:31:05,072 INFO L175 Difference]: Start difference. First operand has 119 places, 109 transitions, 270 flow. Second operand 6 states and 522 transitions. [2025-04-30 10:31:05,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 124 transitions, 384 flow [2025-04-30 10:31:05,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 372 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:31:05,075 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 266 flow [2025-04-30 10:31:05,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2025-04-30 10:31:05,075 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 7 predicate places. [2025-04-30 10:31:05,076 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 266 flow [2025-04-30 10:31:05,077 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-30 10:31:05,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:05,077 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] [2025-04-30 10:31:05,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:31:05,077 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:05,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1019496017, now seen corresponding path program 1 times [2025-04-30 10:31:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:05,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869089894] [2025-04-30 10:31:05,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:05,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:05,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:31:05,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:31:05,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:05,107 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-30 10:31:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:05,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869089894] [2025-04-30 10:31:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869089894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:05,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129217610] [2025-04-30 10:31:05,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:05,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:05,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:05,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:05,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-04-30 10:31:05,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-30 10:31:05,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:05,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-04-30 10:31:05,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:05,210 INFO L116 PetriNetUnfolderBase]: 170/1036 cut-off events. [2025-04-30 10:31:05,210 INFO L117 PetriNetUnfolderBase]: For 196/323 co-relation queries the response was YES. [2025-04-30 10:31:05,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1036 events. 170/1036 cut-off events. For 196/323 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7394 event pairs, 74 based on Foata normal form. 4/903 useless extension candidates. Maximal degree in co-relation 670. Up to 268 conditions per place. [2025-04-30 10:31:05,216 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-04-30 10:31:05,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 350 flow [2025-04-30 10:31:05,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2025-04-30 10:31:05,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9252336448598131 [2025-04-30 10:31:05,217 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 266 flow. Second operand 3 states and 297 transitions. [2025-04-30 10:31:05,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 350 flow [2025-04-30 10:31:05,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 340 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:05,220 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 312 flow [2025-04-30 10:31:05,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2025-04-30 10:31:05,221 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places. [2025-04-30 10:31:05,221 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 312 flow [2025-04-30 10:31:05,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-30 10:31:05,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:05,222 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-30 10:31:05,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:31:05,222 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:05,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash 890523606, now seen corresponding path program 1 times [2025-04-30 10:31:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:05,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550659673] [2025-04-30 10:31:05,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:05,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:31:05,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:31:05,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:05,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:05,433 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-30 10:31:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:05,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550659673] [2025-04-30 10:31:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550659673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:05,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704227739] [2025-04-30 10:31:05,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:05,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:05,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:05,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:05,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2025-04-30 10:31:05,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-30 10:31:05,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:05,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2025-04-30 10:31:05,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:05,672 INFO L116 PetriNetUnfolderBase]: 358/1837 cut-off events. [2025-04-30 10:31:05,672 INFO L117 PetriNetUnfolderBase]: For 314/362 co-relation queries the response was YES. [2025-04-30 10:31:05,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 1837 events. 358/1837 cut-off events. For 314/362 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 15466 event pairs, 179 based on Foata normal form. 4/1681 useless extension candidates. Maximal degree in co-relation 2430. Up to 362 conditions per place. [2025-04-30 10:31:05,682 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 34 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-04-30 10:31:05,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 128 transitions, 420 flow [2025-04-30 10:31:05,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2025-04-30 10:31:05,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8286604361370716 [2025-04-30 10:31:05,683 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 312 flow. Second operand 6 states and 532 transitions. [2025-04-30 10:31:05,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 128 transitions, 420 flow [2025-04-30 10:31:05,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 128 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:05,687 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 306 flow [2025-04-30 10:31:05,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2025-04-30 10:31:05,688 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-04-30 10:31:05,689 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 306 flow [2025-04-30 10:31:05,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-30 10:31:05,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:05,689 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] [2025-04-30 10:31:05,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:31:05,689 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:05,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash -418324317, now seen corresponding path program 1 times [2025-04-30 10:31:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:05,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053459777] [2025-04-30 10:31:05,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:05,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:31:05,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:31:05,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:05,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:05,775 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-30 10:31:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:05,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053459777] [2025-04-30 10:31:05,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053459777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:31:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342635513] [2025-04-30 10:31:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:05,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:05,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:05,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:05,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2025-04-30 10:31:05,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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-30 10:31:05,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:05,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2025-04-30 10:31:05,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:05,969 INFO L116 PetriNetUnfolderBase]: 141/1023 cut-off events. [2025-04-30 10:31:05,969 INFO L117 PetriNetUnfolderBase]: For 138/165 co-relation queries the response was YES. [2025-04-30 10:31:05,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1023 events. 141/1023 cut-off events. For 138/165 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7096 event pairs, 43 based on Foata normal form. 15/973 useless extension candidates. Maximal degree in co-relation 974. Up to 189 conditions per place. [2025-04-30 10:31:05,972 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 23 selfloop transitions, 6 changer transitions 6/125 dead transitions. [2025-04-30 10:31:05,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 406 flow [2025-04-30 10:31:05,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2025-04-30 10:31:05,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2025-04-30 10:31:05,975 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 306 flow. Second operand 6 states and 552 transitions. [2025-04-30 10:31:05,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 406 flow [2025-04-30 10:31:05,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 125 transitions, 394 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:05,978 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 312 flow [2025-04-30 10:31:05,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-04-30 10:31:05,978 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2025-04-30 10:31:05,979 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 312 flow [2025-04-30 10:31:05,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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-30 10:31:05,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:05,980 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:31:05,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:31:05,980 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:05,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1956806883, now seen corresponding path program 1 times [2025-04-30 10:31:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:05,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638644624] [2025-04-30 10:31:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:31:05,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:31:05,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:05,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:06,010 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-30 10:31:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:06,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638644624] [2025-04-30 10:31:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638644624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:06,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485911423] [2025-04-30 10:31:06,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:06,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:06,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:06,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:06,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-04-30 10:31:06,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-30 10:31:06,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:06,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-04-30 10:31:06,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:06,077 INFO L116 PetriNetUnfolderBase]: 56/628 cut-off events. [2025-04-30 10:31:06,078 INFO L117 PetriNetUnfolderBase]: For 215/280 co-relation queries the response was YES. [2025-04-30 10:31:06,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 628 events. 56/628 cut-off events. For 215/280 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3792 event pairs, 30 based on Foata normal form. 3/608 useless extension candidates. Maximal degree in co-relation 892. Up to 119 conditions per place. [2025-04-30 10:31:06,080 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 1/119 dead transitions. [2025-04-30 10:31:06,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 389 flow [2025-04-30 10:31:06,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-04-30 10:31:06,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9221183800623053 [2025-04-30 10:31:06,082 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 312 flow. Second operand 3 states and 296 transitions. [2025-04-30 10:31:06,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 389 flow [2025-04-30 10:31:06,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 381 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:31:06,084 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 354 flow [2025-04-30 10:31:06,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2025-04-30 10:31:06,084 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 11 predicate places. [2025-04-30 10:31:06,084 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 354 flow [2025-04-30 10:31:06,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-30 10:31:06,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:06,085 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-30 10:31:06,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:31:06,085 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:31:06,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1211999262, now seen corresponding path program 1 times [2025-04-30 10:31:06,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:06,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976263584] [2025-04-30 10:31:06,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:06,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:31:06,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:31:06,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:06,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:06,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:06,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:31:06,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:31:06,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:06,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:06,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:06,125 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:06,125 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-30 10:31:06,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:31:06,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-30 10:31:06,125 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-30 10:31:06,126 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:31:06,126 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:31:06,126 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:31:06,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:31:06,126 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:06,127 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:06,127 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:31:06,143 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-30 10:31:06,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 277 flow [2025-04-30 10:31:06,164 INFO L116 PetriNetUnfolderBase]: 9/338 cut-off events. [2025-04-30 10:31:06,165 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-30 10:31:06,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 338 events. 9/338 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 940 event pairs, 1 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 213. Up to 12 conditions per place. [2025-04-30 10:31:06,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 277 flow [2025-04-30 10:31:06,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 277 flow [2025-04-30 10:31:06,168 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:06,169 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;@1ace8bd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:06,169 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-30 10:31:06,171 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:06,171 INFO L116 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-04-30 10:31:06,171 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:06,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:06,171 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] [2025-04-30 10:31:06,171 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:06,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash 163298847, now seen corresponding path program 1 times [2025-04-30 10:31:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:06,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955556807] [2025-04-30 10:31:06,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:06,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:31:06,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:31:06,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:06,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:06,188 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-30 10:31:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:06,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955556807] [2025-04-30 10:31:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955556807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:06,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:06,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515636356] [2025-04-30 10:31:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:06,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:06,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:06,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:06,203 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 125 [2025-04-30 10:31:06,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 277 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-30 10:31:06,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:06,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 125 [2025-04-30 10:31:06,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:06,509 INFO L116 PetriNetUnfolderBase]: 1071/4022 cut-off events. [2025-04-30 10:31:06,510 INFO L117 PetriNetUnfolderBase]: For 401/506 co-relation queries the response was YES. [2025-04-30 10:31:06,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 4022 events. 1071/4022 cut-off events. For 401/506 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 36240 event pairs, 542 based on Foata normal form. 1/3582 useless extension candidates. Maximal degree in co-relation 4652. Up to 1110 conditions per place. [2025-04-30 10:31:06,533 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 23 selfloop transitions, 5 changer transitions 1/134 dead transitions. [2025-04-30 10:31:06,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 351 flow [2025-04-30 10:31:06,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2025-04-30 10:31:06,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.928 [2025-04-30 10:31:06,534 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 277 flow. Second operand 3 states and 348 transitions. [2025-04-30 10:31:06,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 351 flow [2025-04-30 10:31:06,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:06,536 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 311 flow [2025-04-30 10:31:06,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-04-30 10:31:06,536 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places. [2025-04-30 10:31:06,538 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 311 flow [2025-04-30 10:31:06,538 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-30 10:31:06,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:06,538 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] [2025-04-30 10:31:06,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:31:06,538 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:06,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2131362105, now seen corresponding path program 1 times [2025-04-30 10:31:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:06,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175510547] [2025-04-30 10:31:06,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:06,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:06,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:06,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:06,589 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-30 10:31:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:06,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175510547] [2025-04-30 10:31:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175510547] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:06,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:06,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096533690] [2025-04-30 10:31:06,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:06,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:06,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:06,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:06,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:06,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 125 [2025-04-30 10:31:06,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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-30 10:31:06,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:06,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 125 [2025-04-30 10:31:06,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:07,139 INFO L116 PetriNetUnfolderBase]: 1404/6338 cut-off events. [2025-04-30 10:31:07,140 INFO L117 PetriNetUnfolderBase]: For 436/444 co-relation queries the response was YES. [2025-04-30 10:31:07,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9236 conditions, 6338 events. 1404/6338 cut-off events. For 436/444 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 64099 event pairs, 1086 based on Foata normal form. 1/5699 useless extension candidates. Maximal degree in co-relation 5660. Up to 1847 conditions per place. [2025-04-30 10:31:07,179 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 24 selfloop transitions, 2 changer transitions 5/135 dead transitions. [2025-04-30 10:31:07,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 389 flow [2025-04-30 10:31:07,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2025-04-30 10:31:07,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8506666666666667 [2025-04-30 10:31:07,182 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 311 flow. Second operand 6 states and 638 transitions. [2025-04-30 10:31:07,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 389 flow [2025-04-30 10:31:07,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 135 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:07,189 INFO L231 Difference]: Finished difference. Result has 138 places, 128 transitions, 323 flow [2025-04-30 10:31:07,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=138, PETRI_TRANSITIONS=128} [2025-04-30 10:31:07,190 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 10 predicate places. [2025-04-30 10:31:07,190 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 128 transitions, 323 flow [2025-04-30 10:31:07,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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-30 10:31:07,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:07,191 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] [2025-04-30 10:31:07,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:31:07,191 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:07,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash 416648429, now seen corresponding path program 1 times [2025-04-30 10:31:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:07,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744378444] [2025-04-30 10:31:07,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:07,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:07,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:07,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:07,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:07,372 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-30 10:31:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:07,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744378444] [2025-04-30 10:31:07,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744378444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:07,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:07,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878558233] [2025-04-30 10:31:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:07,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:07,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:07,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:07,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125 [2025-04-30 10:31:07,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 128 transitions, 323 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-30 10:31:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125 [2025-04-30 10:31:07,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:07,985 INFO L116 PetriNetUnfolderBase]: 2000/6722 cut-off events. [2025-04-30 10:31:07,985 INFO L117 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2025-04-30 10:31:08,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10951 conditions, 6722 events. 2000/6722 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 67130 event pairs, 899 based on Foata normal form. 0/6080 useless extension candidates. Maximal degree in co-relation 10613. Up to 2164 conditions per place. [2025-04-30 10:31:08,071 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 49 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-04-30 10:31:08,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 151 transitions, 477 flow [2025-04-30 10:31:08,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2025-04-30 10:31:08,073 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.824 [2025-04-30 10:31:08,073 INFO L175 Difference]: Start difference. First operand has 138 places, 128 transitions, 323 flow. Second operand 6 states and 618 transitions. [2025-04-30 10:31:08,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 151 transitions, 477 flow [2025-04-30 10:31:08,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 151 transitions, 465 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:31:08,079 INFO L231 Difference]: Finished difference. Result has 135 places, 127 transitions, 319 flow [2025-04-30 10:31:08,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=135, PETRI_TRANSITIONS=127} [2025-04-30 10:31:08,080 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2025-04-30 10:31:08,080 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 127 transitions, 319 flow [2025-04-30 10:31:08,080 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-30 10:31:08,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:08,080 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] [2025-04-30 10:31:08,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:31:08,081 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:08,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -278206527, now seen corresponding path program 1 times [2025-04-30 10:31:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:08,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598577576] [2025-04-30 10:31:08,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:08,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:31:08,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:31:08,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:08,106 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-30 10:31:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:08,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598577576] [2025-04-30 10:31:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598577576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:08,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85818094] [2025-04-30 10:31:08,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:08,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:08,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:08,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:08,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2025-04-30 10:31:08,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 127 transitions, 319 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-30 10:31:08,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:08,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2025-04-30 10:31:08,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:08,559 INFO L116 PetriNetUnfolderBase]: 1740/6603 cut-off events. [2025-04-30 10:31:08,559 INFO L117 PetriNetUnfolderBase]: For 1549/2154 co-relation queries the response was YES. [2025-04-30 10:31:08,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10928 conditions, 6603 events. 1740/6603 cut-off events. For 1549/2154 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 68490 event pairs, 967 based on Foata normal form. 10/5814 useless extension candidates. Maximal degree in co-relation 9146. Up to 2240 conditions per place. [2025-04-30 10:31:08,586 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 29 selfloop transitions, 9 changer transitions 0/142 dead transitions. [2025-04-30 10:31:08,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 142 transitions, 453 flow [2025-04-30 10:31:08,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-04-30 10:31:08,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9226666666666666 [2025-04-30 10:31:08,588 INFO L175 Difference]: Start difference. First operand has 135 places, 127 transitions, 319 flow. Second operand 3 states and 346 transitions. [2025-04-30 10:31:08,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 142 transitions, 453 flow [2025-04-30 10:31:08,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 443 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:08,590 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 385 flow [2025-04-30 10:31:08,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2025-04-30 10:31:08,590 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2025-04-30 10:31:08,590 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 385 flow [2025-04-30 10:31:08,591 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-30 10:31:08,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:08,591 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-30 10:31:08,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:31:08,591 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:08,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash 30370339, now seen corresponding path program 1 times [2025-04-30 10:31:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:08,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802778831] [2025-04-30 10:31:08,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:08,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:31:08,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:31:08,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:08,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:08,787 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-30 10:31:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:08,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802778831] [2025-04-30 10:31:08,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802778831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:08,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:08,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527494383] [2025-04-30 10:31:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:08,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:08,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:08,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:08,854 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 125 [2025-04-30 10:31:08,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-30 10:31:08,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:08,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 125 [2025-04-30 10:31:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:09,720 INFO L116 PetriNetUnfolderBase]: 2874/10393 cut-off events. [2025-04-30 10:31:09,721 INFO L117 PetriNetUnfolderBase]: For 1654/2136 co-relation queries the response was YES. [2025-04-30 10:31:09,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17543 conditions, 10393 events. 2874/10393 cut-off events. For 1654/2136 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 114810 event pairs, 1408 based on Foata normal form. 27/9250 useless extension candidates. Maximal degree in co-relation 13956. Up to 2157 conditions per place. [2025-04-30 10:31:09,758 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 46 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-04-30 10:31:09,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 157 transitions, 533 flow [2025-04-30 10:31:09,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2025-04-30 10:31:09,760 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8373333333333334 [2025-04-30 10:31:09,760 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 385 flow. Second operand 6 states and 628 transitions. [2025-04-30 10:31:09,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 157 transitions, 533 flow [2025-04-30 10:31:09,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 157 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:09,766 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 375 flow [2025-04-30 10:31:09,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, 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=375, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-04-30 10:31:09,767 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places. [2025-04-30 10:31:09,767 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 375 flow [2025-04-30 10:31:09,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-30 10:31:09,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:09,767 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] [2025-04-30 10:31:09,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:31:09,767 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:09,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1561971664, now seen corresponding path program 1 times [2025-04-30 10:31:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:09,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815187696] [2025-04-30 10:31:09,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:09,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:31:09,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:31:09,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:09,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:09,820 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-30 10:31:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:09,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815187696] [2025-04-30 10:31:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815187696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:31:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588566373] [2025-04-30 10:31:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:09,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:09,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:09,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:09,911 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-04-30 10:31:09,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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-30 10:31:09,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:09,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-04-30 10:31:09,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:10,265 INFO L116 PetriNetUnfolderBase]: 1307/6235 cut-off events. [2025-04-30 10:31:10,266 INFO L117 PetriNetUnfolderBase]: For 994/1251 co-relation queries the response was YES. [2025-04-30 10:31:10,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10208 conditions, 6235 events. 1307/6235 cut-off events. For 994/1251 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 64642 event pairs, 664 based on Foata normal form. 65/5759 useless extension candidates. Maximal degree in co-relation 5448. Up to 1257 conditions per place. [2025-04-30 10:31:10,300 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 38 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-04-30 10:31:10,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 512 flow [2025-04-30 10:31:10,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions. [2025-04-30 10:31:10,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.86 [2025-04-30 10:31:10,302 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 375 flow. Second operand 6 states and 645 transitions. [2025-04-30 10:31:10,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 512 flow [2025-04-30 10:31:10,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 500 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:10,306 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 391 flow [2025-04-30 10:31:10,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2025-04-30 10:31:10,307 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 10 predicate places. [2025-04-30 10:31:10,307 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 391 flow [2025-04-30 10:31:10,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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-30 10:31:10,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:10,307 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:31:10,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:31:10,308 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:10,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1223634234, now seen corresponding path program 1 times [2025-04-30 10:31:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:10,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065153994] [2025-04-30 10:31:10,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:10,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:31:10,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:31:10,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:10,370 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-30 10:31:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:10,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065153994] [2025-04-30 10:31:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065153994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:10,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:10,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:10,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037034592] [2025-04-30 10:31:10,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:10,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:10,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:10,389 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2025-04-30 10:31:10,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-30 10:31:10,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:10,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2025-04-30 10:31:10,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:10,725 INFO L116 PetriNetUnfolderBase]: 1088/4910 cut-off events. [2025-04-30 10:31:10,725 INFO L117 PetriNetUnfolderBase]: For 2378/2615 co-relation queries the response was YES. [2025-04-30 10:31:10,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9012 conditions, 4910 events. 1088/4910 cut-off events. For 2378/2615 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 51525 event pairs, 589 based on Foata normal form. 8/4547 useless extension candidates. Maximal degree in co-relation 8255. Up to 1450 conditions per place. [2025-04-30 10:31:10,756 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 31 selfloop transitions, 13 changer transitions 0/151 dead transitions. [2025-04-30 10:31:10,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 151 transitions, 552 flow [2025-04-30 10:31:10,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2025-04-30 10:31:10,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.92 [2025-04-30 10:31:10,758 INFO L175 Difference]: Start difference. First operand has 138 places, 135 transitions, 391 flow. Second operand 3 states and 345 transitions. [2025-04-30 10:31:10,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 151 transitions, 552 flow [2025-04-30 10:31:10,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 151 transitions, 544 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:31:10,762 INFO L231 Difference]: Finished difference. Result has 139 places, 144 transitions, 501 flow [2025-04-30 10:31:10,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=139, PETRI_TRANSITIONS=144} [2025-04-30 10:31:10,763 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 11 predicate places. [2025-04-30 10:31:10,763 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 144 transitions, 501 flow [2025-04-30 10:31:10,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-30 10:31:10,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:10,764 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2025-04-30 10:31:10,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:31:10,764 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:10,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash -368692658, now seen corresponding path program 1 times [2025-04-30 10:31:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:10,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757776298] [2025-04-30 10:31:10,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:10,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:31:10,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:31:10,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:10,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:10,818 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-30 10:31:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:10,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757776298] [2025-04-30 10:31:10,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757776298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:10,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:31:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127421887] [2025-04-30 10:31:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:10,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:10,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:10,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:10,827 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 125 [2025-04-30 10:31:10,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 144 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-30 10:31:10,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:10,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 125 [2025-04-30 10:31:10,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:10,935 INFO L116 PetriNetUnfolderBase]: 117/1565 cut-off events. [2025-04-30 10:31:10,935 INFO L117 PetriNetUnfolderBase]: For 682/724 co-relation queries the response was YES. [2025-04-30 10:31:10,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 1565 events. 117/1565 cut-off events. For 682/724 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 12852 event pairs, 43 based on Foata normal form. 21/1532 useless extension candidates. Maximal degree in co-relation 2091. Up to 144 conditions per place. [2025-04-30 10:31:10,941 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 12 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-04-30 10:31:10,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 474 flow [2025-04-30 10:31:10,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2025-04-30 10:31:10,942 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.944 [2025-04-30 10:31:10,942 INFO L175 Difference]: Start difference. First operand has 139 places, 144 transitions, 501 flow. Second operand 3 states and 354 transitions. [2025-04-30 10:31:10,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 474 flow [2025-04-30 10:31:10,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 139 transitions, 460 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:10,945 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 405 flow [2025-04-30 10:31:10,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2025-04-30 10:31:10,946 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 11 predicate places. [2025-04-30 10:31:10,946 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 405 flow [2025-04-30 10:31:10,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-30 10:31:10,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:10,947 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-30 10:31:10,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:31:10,947 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:10,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1035996128, now seen corresponding path program 1 times [2025-04-30 10:31:10,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:10,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797018310] [2025-04-30 10:31:10,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:10,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:10,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:31:10,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:31:10,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:10,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:10,979 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-30 10:31:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:10,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797018310] [2025-04-30 10:31:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797018310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:10,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:10,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940114947] [2025-04-30 10:31:10,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:10,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:10,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:10,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:10,992 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2025-04-30 10:31:10,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-30 10:31:10,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:10,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2025-04-30 10:31:10,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:11,130 INFO L116 PetriNetUnfolderBase]: 203/1858 cut-off events. [2025-04-30 10:31:11,130 INFO L117 PetriNetUnfolderBase]: For 1312/1377 co-relation queries the response was YES. [2025-04-30 10:31:11,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 1858 events. 203/1858 cut-off events. For 1312/1377 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16319 event pairs, 134 based on Foata normal form. 3/1769 useless extension candidates. Maximal degree in co-relation 2878. Up to 435 conditions per place. [2025-04-30 10:31:11,135 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 25 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-04-30 10:31:11,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 487 flow [2025-04-30 10:31:11,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-04-30 10:31:11,136 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9013333333333333 [2025-04-30 10:31:11,136 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 405 flow. Second operand 3 states and 338 transitions. [2025-04-30 10:31:11,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 487 flow [2025-04-30 10:31:11,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:31:11,138 INFO L231 Difference]: Finished difference. Result has 142 places, 137 transitions, 439 flow [2025-04-30 10:31:11,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=142, PETRI_TRANSITIONS=137} [2025-04-30 10:31:11,139 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2025-04-30 10:31:11,139 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 137 transitions, 439 flow [2025-04-30 10:31:11,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-30 10:31:11,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:11,140 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2025-04-30 10:31:11,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:31:11,140 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:31:11,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -930862011, now seen corresponding path program 1 times [2025-04-30 10:31:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:11,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687953826] [2025-04-30 10:31:11,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:11,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-30 10:31:11,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-30 10:31:11,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:11,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:11,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:11,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-30 10:31:11,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-30 10:31:11,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:11,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:11,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:11,183 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:11,183 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-30 10:31:11,183 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-30 10:31:11,183 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-30 10:31:11,183 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-30 10:31:11,183 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-30 10:31:11,184 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-30 10:31:11,184 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-30 10:31:11,184 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-30 10:31:11,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:31:11,184 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:11,185 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:11,185 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-30 10:31:11,205 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-30 10:31:11,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 143 transitions, 326 flow [2025-04-30 10:31:11,243 INFO L116 PetriNetUnfolderBase]: 22/571 cut-off events. [2025-04-30 10:31:11,243 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-30 10:31:11,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 571 events. 22/571 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2088 event pairs, 6 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 358. Up to 32 conditions per place. [2025-04-30 10:31:11,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 143 transitions, 326 flow [2025-04-30 10:31:11,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 143 transitions, 326 flow [2025-04-30 10:31:11,249 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:11,249 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;@1ace8bd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:11,249 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:31:11,250 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:11,250 INFO L116 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-04-30 10:31:11,250 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:11,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:11,250 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] [2025-04-30 10:31:11,250 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:11,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2062995969, now seen corresponding path program 1 times [2025-04-30 10:31:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:11,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069771290] [2025-04-30 10:31:11,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:11,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:31:11,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:31:11,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:11,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:11,266 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-30 10:31:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:11,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069771290] [2025-04-30 10:31:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069771290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:11,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:11,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094422599] [2025-04-30 10:31:11,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:11,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:11,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:11,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:11,280 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 143 [2025-04-30 10:31:11,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 143 transitions, 326 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-30 10:31:11,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:11,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 143 [2025-04-30 10:31:11,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:13,041 INFO L116 PetriNetUnfolderBase]: 7859/23535 cut-off events. [2025-04-30 10:31:13,041 INFO L117 PetriNetUnfolderBase]: For 2444/2795 co-relation queries the response was YES. [2025-04-30 10:31:13,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35885 conditions, 23535 events. 7859/23535 cut-off events. For 2444/2795 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 271983 event pairs, 4292 based on Foata normal form. 1/21316 useless extension candidates. Maximal degree in co-relation 28583. Up to 7653 conditions per place. [2025-04-30 10:31:13,155 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 30 selfloop transitions, 6 changer transitions 1/155 dead transitions. [2025-04-30 10:31:13,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 155 transitions, 422 flow [2025-04-30 10:31:13,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-04-30 10:31:13,157 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9207459207459208 [2025-04-30 10:31:13,157 INFO L175 Difference]: Start difference. First operand has 147 places, 143 transitions, 326 flow. Second operand 3 states and 395 transitions. [2025-04-30 10:31:13,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 155 transitions, 422 flow [2025-04-30 10:31:13,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:13,160 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 368 flow [2025-04-30 10:31:13,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2025-04-30 10:31:13,161 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 4 predicate places. [2025-04-30 10:31:13,161 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 368 flow [2025-04-30 10:31:13,161 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-30 10:31:13,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:13,161 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] [2025-04-30 10:31:13,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:31:13,162 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:13,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1555761913, now seen corresponding path program 1 times [2025-04-30 10:31:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:13,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619730700] [2025-04-30 10:31:13,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:13,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:13,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:13,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:13,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:13,196 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-30 10:31:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:13,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619730700] [2025-04-30 10:31:13,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619730700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:13,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:13,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434398851] [2025-04-30 10:31:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:13,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:31:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:13,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:31:13,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:31:13,252 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2025-04-30 10:31:13,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 368 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-30 10:31:13,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:13,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2025-04-30 10:31:13,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:15,871 INFO L116 PetriNetUnfolderBase]: 8820/32829 cut-off events. [2025-04-30 10:31:15,872 INFO L117 PetriNetUnfolderBase]: For 2371/2467 co-relation queries the response was YES. [2025-04-30 10:31:15,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49181 conditions, 32829 events. 8820/32829 cut-off events. For 2371/2467 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 419043 event pairs, 5746 based on Foata normal form. 1/28525 useless extension candidates. Maximal degree in co-relation 27306. Up to 9926 conditions per place. [2025-04-30 10:31:16,066 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 28 selfloop transitions, 2 changer transitions 5/154 dead transitions. [2025-04-30 10:31:16,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 454 flow [2025-04-30 10:31:16,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2025-04-30 10:31:16,068 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-04-30 10:31:16,068 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 368 flow. Second operand 6 states and 726 transitions. [2025-04-30 10:31:16,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 454 flow [2025-04-30 10:31:16,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 154 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:16,119 INFO L231 Difference]: Finished difference. Result has 157 places, 147 transitions, 378 flow [2025-04-30 10:31:16,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=378, PETRI_PLACES=157, PETRI_TRANSITIONS=147} [2025-04-30 10:31:16,120 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2025-04-30 10:31:16,120 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 147 transitions, 378 flow [2025-04-30 10:31:16,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-30 10:31:16,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:16,120 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] [2025-04-30 10:31:16,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:31:16,121 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:16,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash -158951763, now seen corresponding path program 1 times [2025-04-30 10:31:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:16,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745383455] [2025-04-30 10:31:16,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:16,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:16,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:16,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:16,234 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-30 10:31:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:16,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745383455] [2025-04-30 10:31:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745383455] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677320384] [2025-04-30 10:31:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:16,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:16,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:16,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:16,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 143 [2025-04-30 10:31:16,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 147 transitions, 378 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-30 10:31:16,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:16,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 143 [2025-04-30 10:31:16,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:19,458 INFO L116 PetriNetUnfolderBase]: 13637/36397 cut-off events. [2025-04-30 10:31:19,458 INFO L117 PetriNetUnfolderBase]: For 2948/2948 co-relation queries the response was YES. [2025-04-30 10:31:19,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60774 conditions, 36397 events. 13637/36397 cut-off events. For 2948/2948 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 434197 event pairs, 2788 based on Foata normal form. 0/32044 useless extension candidates. Maximal degree in co-relation 28093. Up to 13301 conditions per place. [2025-04-30 10:31:19,723 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 61 selfloop transitions, 5 changer transitions 0/178 dead transitions. [2025-04-30 10:31:19,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 178 transitions, 572 flow [2025-04-30 10:31:19,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2025-04-30 10:31:19,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2025-04-30 10:31:19,725 INFO L175 Difference]: Start difference. First operand has 157 places, 147 transitions, 378 flow. Second operand 6 states and 714 transitions. [2025-04-30 10:31:19,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 178 transitions, 572 flow [2025-04-30 10:31:19,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 178 transitions, 560 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:31:19,760 INFO L231 Difference]: Finished difference. Result has 154 places, 146 transitions, 374 flow [2025-04-30 10:31:19,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=154, PETRI_TRANSITIONS=146} [2025-04-30 10:31:19,761 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 7 predicate places. [2025-04-30 10:31:19,761 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 146 transitions, 374 flow [2025-04-30 10:31:19,761 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-30 10:31:19,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:19,762 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] [2025-04-30 10:31:19,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:31:19,762 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:19,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash -937917247, now seen corresponding path program 1 times [2025-04-30 10:31:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:19,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987843184] [2025-04-30 10:31:19,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:19,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:31:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:31:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:19,799 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-30 10:31:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:19,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987843184] [2025-04-30 10:31:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987843184] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:19,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:19,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095491160] [2025-04-30 10:31:19,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:19,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:19,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:19,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:19,825 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-04-30 10:31:19,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 146 transitions, 374 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-30 10:31:19,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:19,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-04-30 10:31:19,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:23,324 INFO L116 PetriNetUnfolderBase]: 13629/41376 cut-off events. [2025-04-30 10:31:23,325 INFO L117 PetriNetUnfolderBase]: For 10672/13731 co-relation queries the response was YES. [2025-04-30 10:31:23,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70776 conditions, 41376 events. 13629/41376 cut-off events. For 10672/13731 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 530167 event pairs, 7860 based on Foata normal form. 36/36582 useless extension candidates. Maximal degree in co-relation 58802. Up to 15880 conditions per place. [2025-04-30 10:31:23,620 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 39 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2025-04-30 10:31:23,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 167 transitions, 560 flow [2025-04-30 10:31:23,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-04-30 10:31:23,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9207459207459208 [2025-04-30 10:31:23,622 INFO L175 Difference]: Start difference. First operand has 154 places, 146 transitions, 374 flow. Second operand 3 states and 395 transitions. [2025-04-30 10:31:23,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 167 transitions, 560 flow [2025-04-30 10:31:23,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 167 transitions, 550 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:23,626 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 460 flow [2025-04-30 10:31:23,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2025-04-30 10:31:23,626 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 6 predicate places. [2025-04-30 10:31:23,626 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 460 flow [2025-04-30 10:31:23,627 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-30 10:31:23,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:23,627 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-30 10:31:23,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:31:23,627 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:23,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1425970686, now seen corresponding path program 1 times [2025-04-30 10:31:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:23,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820140921] [2025-04-30 10:31:23,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:23,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:23,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:31:23,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:31:23,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:23,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:23,751 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-30 10:31:23,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:23,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820140921] [2025-04-30 10:31:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820140921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:31:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931407978] [2025-04-30 10:31:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:23,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:23,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:23,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:23,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2025-04-30 10:31:23,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-30 10:31:23,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:23,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2025-04-30 10:31:23,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:27,939 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([580] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 132#L1024true, 172#true, 44#L1022-3true, Black: 152#(= |#race~data~0| 0), 57#L1023-5true, 146#true, 177#true, 147#true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 144#true, 142#true, Black: 157#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-30 10:31:27,939 INFO L286 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-04-30 10:31:27,939 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-04-30 10:31:27,940 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-30 10:31:27,940 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-30 10:31:28,236 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][184], [120#L1038-1true, 172#true, 99#L1023-6true, 148#true, Black: 152#(= |#race~data~0| 0), 57#L1023-5true, 146#true, 177#true, 143#true, 22#L1023-5true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 142#true, Black: 157#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-30 10:31:28,236 INFO L286 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-04-30 10:31:28,236 INFO L289 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-04-30 10:31:28,236 INFO L289 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-04-30 10:31:28,236 INFO L289 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-04-30 10:31:28,281 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([580] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 114#L1023-5true, 172#true, Black: 152#(= |#race~data~0| 0), 57#L1023-5true, 146#true, 177#true, 147#true, 19#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 144#true, 142#true, Black: 157#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-30 10:31:28,282 INFO L286 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-04-30 10:31:28,282 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:28,282 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:28,282 INFO L289 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-04-30 10:31:28,589 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][179], [120#L1038-1true, 132#L1024true, 172#true, 148#true, Black: 152#(= |#race~data~0| 0), 57#L1023-5true, 146#true, 177#true, 143#true, 22#L1023-5true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 142#true, Black: 157#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-30 10:31:28,589 INFO L286 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2025-04-30 10:31:28,589 INFO L289 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-04-30 10:31:28,589 INFO L289 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-04-30 10:31:28,589 INFO L289 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-04-30 10:31:28,929 INFO L116 PetriNetUnfolderBase]: 19999/58031 cut-off events. [2025-04-30 10:31:28,930 INFO L117 PetriNetUnfolderBase]: For 9359/12987 co-relation queries the response was YES. [2025-04-30 10:31:29,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100957 conditions, 58031 events. 19999/58031 cut-off events. For 9359/12987 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 760932 event pairs, 9797 based on Foata normal form. 80/50818 useless extension candidates. Maximal degree in co-relation 79535. Up to 12713 conditions per place. [2025-04-30 10:31:29,499 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 58 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-04-30 10:31:29,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 186 transitions, 648 flow [2025-04-30 10:31:29,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2025-04-30 10:31:29,501 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8438228438228438 [2025-04-30 10:31:29,501 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 460 flow. Second operand 6 states and 724 transitions. [2025-04-30 10:31:29,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 186 transitions, 648 flow [2025-04-30 10:31:29,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 186 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:29,568 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 446 flow [2025-04-30 10:31:29,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2025-04-30 10:31:29,568 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2025-04-30 10:31:29,568 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 446 flow [2025-04-30 10:31:29,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-30 10:31:29,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:29,569 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] [2025-04-30 10:31:29,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:31:29,569 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:29,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1992563105, now seen corresponding path program 1 times [2025-04-30 10:31:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:29,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358784946] [2025-04-30 10:31:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:29,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:31:29,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:31:29,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:29,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:31:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:29,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358784946] [2025-04-30 10:31:29,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358784946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:29,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:29,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:31:29,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106113739] [2025-04-30 10:31:29,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:29,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:31:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:29,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:31:29,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:31:29,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 143 [2025-04-30 10:31:29,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-30 10:31:29,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:29,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 143 [2025-04-30 10:31:29,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:31,749 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][175], [120#L1038-1true, 99#L1023-6true, 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 152#(= |#race~data~0| 0), 57#L1023-5true, 146#true, 177#true, 143#true, 22#L1023-5true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 142#true, Black: 157#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-30 10:31:31,749 INFO L286 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-04-30 10:31:31,749 INFO L289 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-04-30 10:31:31,750 INFO L289 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-04-30 10:31:31,750 INFO L289 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-04-30 10:31:32,408 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][174], [120#L1038-1true, 132#L1024true, 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 152#(= |#race~data~0| 0), 146#true, 57#L1023-5true, 177#true, 143#true, 22#L1023-5true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 142#true, Black: 157#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-30 10:31:32,408 INFO L286 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2025-04-30 10:31:32,409 INFO L289 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-04-30 10:31:32,409 INFO L289 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-04-30 10:31:32,409 INFO L289 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2025-04-30 10:31:32,815 INFO L116 PetriNetUnfolderBase]: 10063/36474 cut-off events. [2025-04-30 10:31:32,815 INFO L117 PetriNetUnfolderBase]: For 6131/8102 co-relation queries the response was YES. [2025-04-30 10:31:32,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61443 conditions, 36474 events. 10063/36474 cut-off events. For 6131/8102 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 476695 event pairs, 4496 based on Foata normal form. 284/32609 useless extension candidates. Maximal degree in co-relation 31539. Up to 7614 conditions per place. [2025-04-30 10:31:33,104 INFO L140 encePairwiseOnDemand]: 136/143 looper letters, 47 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2025-04-30 10:31:33,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 178 transitions, 614 flow [2025-04-30 10:31:33,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:31:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:31:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2025-04-30 10:31:33,106 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8601398601398601 [2025-04-30 10:31:33,106 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 446 flow. Second operand 6 states and 738 transitions. [2025-04-30 10:31:33,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 178 transitions, 614 flow [2025-04-30 10:31:33,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 178 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:31:33,122 INFO L231 Difference]: Finished difference. Result has 157 places, 156 transitions, 462 flow [2025-04-30 10:31:33,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2025-04-30 10:31:33,123 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2025-04-30 10:31:33,123 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 462 flow [2025-04-30 10:31:33,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-30 10:31:33,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:33,123 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:31:33,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:31:33,124 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:33,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1300507207, now seen corresponding path program 1 times [2025-04-30 10:31:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:33,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776161379] [2025-04-30 10:31:33,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:33,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:31:33,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:31:33,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:33,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:31:33,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:33,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776161379] [2025-04-30 10:31:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776161379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473633629] [2025-04-30 10:31:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:33,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:33,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:33,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:33,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-04-30 10:31:33,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 462 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-30 10:31:33,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:33,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-04-30 10:31:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:36,900 INFO L116 PetriNetUnfolderBase]: 11741/40880 cut-off events. [2025-04-30 10:31:36,900 INFO L117 PetriNetUnfolderBase]: For 22467/25546 co-relation queries the response was YES. [2025-04-30 10:31:37,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76769 conditions, 40880 events. 11741/40880 cut-off events. For 22467/25546 co-relation queries the response was YES. Maximal size of possible extension queue 1526. Compared 557696 event pairs, 6051 based on Foata normal form. 47/36748 useless extension candidates. Maximal degree in co-relation 29536. Up to 13416 conditions per place. [2025-04-30 10:31:37,192 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 43 selfloop transitions, 18 changer transitions 0/181 dead transitions. [2025-04-30 10:31:37,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 181 transitions, 707 flow [2025-04-30 10:31:37,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-04-30 10:31:37,193 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9184149184149184 [2025-04-30 10:31:37,193 INFO L175 Difference]: Start difference. First operand has 157 places, 156 transitions, 462 flow. Second operand 3 states and 394 transitions. [2025-04-30 10:31:37,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 181 transitions, 707 flow [2025-04-30 10:31:37,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 181 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:31:37,203 INFO L231 Difference]: Finished difference. Result has 158 places, 170 transitions, 632 flow [2025-04-30 10:31:37,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=158, PETRI_TRANSITIONS=170} [2025-04-30 10:31:37,203 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2025-04-30 10:31:37,203 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 170 transitions, 632 flow [2025-04-30 10:31:37,203 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-30 10:31:37,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:37,203 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2025-04-30 10:31:37,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:31:37,203 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:37,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 327113517, now seen corresponding path program 1 times [2025-04-30 10:31:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:37,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547770409] [2025-04-30 10:31:37,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:37,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:31:37,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:31:37,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:37,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:31:37,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:37,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547770409] [2025-04-30 10:31:37,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547770409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:37,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:37,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:31:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911958098] [2025-04-30 10:31:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:37,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:37,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:37,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:37,272 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 143 [2025-04-30 10:31:37,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 170 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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-30 10:31:37,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:37,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 143 [2025-04-30 10:31:37,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:37,923 INFO L116 PetriNetUnfolderBase]: 688/6745 cut-off events. [2025-04-30 10:31:37,923 INFO L117 PetriNetUnfolderBase]: For 3181/3633 co-relation queries the response was YES. [2025-04-30 10:31:37,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11139 conditions, 6745 events. 688/6745 cut-off events. For 3181/3633 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 77284 event pairs, 149 based on Foata normal form. 177/6537 useless extension candidates. Maximal degree in co-relation 4490. Up to 662 conditions per place. [2025-04-30 10:31:37,967 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 16 selfloop transitions, 8 changer transitions 0/160 dead transitions. [2025-04-30 10:31:37,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 565 flow [2025-04-30 10:31:37,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2025-04-30 10:31:37,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-04-30 10:31:37,968 INFO L175 Difference]: Start difference. First operand has 158 places, 170 transitions, 632 flow. Second operand 3 states and 403 transitions. [2025-04-30 10:31:37,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 565 flow [2025-04-30 10:31:37,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 160 transitions, 551 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:37,977 INFO L231 Difference]: Finished difference. Result has 158 places, 153 transitions, 472 flow [2025-04-30 10:31:37,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=158, PETRI_TRANSITIONS=153} [2025-04-30 10:31:37,978 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2025-04-30 10:31:37,978 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 472 flow [2025-04-30 10:31:37,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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-30 10:31:37,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:37,978 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-30 10:31:37,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-30 10:31:37,979 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:37,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2059539760, now seen corresponding path program 1 times [2025-04-30 10:31:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:37,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816609490] [2025-04-30 10:31:37,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:37,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:31:37,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:31:37,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:37,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:31:38,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:38,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816609490] [2025-04-30 10:31:38,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816609490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:38,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:38,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981430219] [2025-04-30 10:31:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:38,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:38,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:38,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:38,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:38,030 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-04-30 10:31:38,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-30 10:31:38,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:38,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-04-30 10:31:38,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:38,669 INFO L116 PetriNetUnfolderBase]: 1120/7987 cut-off events. [2025-04-30 10:31:38,669 INFO L117 PetriNetUnfolderBase]: For 6356/6475 co-relation queries the response was YES. [2025-04-30 10:31:38,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15239 conditions, 7987 events. 1120/7987 cut-off events. For 6356/6475 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 95939 event pairs, 661 based on Foata normal form. 4/7477 useless extension candidates. Maximal degree in co-relation 11999. Up to 2068 conditions per place. [2025-04-30 10:31:38,701 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/160 dead transitions. [2025-04-30 10:31:38,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 586 flow [2025-04-30 10:31:38,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2025-04-30 10:31:38,701 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8951048951048951 [2025-04-30 10:31:38,702 INFO L175 Difference]: Start difference. First operand has 158 places, 153 transitions, 472 flow. Second operand 3 states and 384 transitions. [2025-04-30 10:31:38,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 586 flow [2025-04-30 10:31:38,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 160 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:31:38,705 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 504 flow [2025-04-30 10:31:38,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2025-04-30 10:31:38,706 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2025-04-30 10:31:38,706 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 504 flow [2025-04-30 10:31:38,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-30 10:31:38,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:38,706 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:38,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-30 10:31:38,706 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:38,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1849986104, now seen corresponding path program 1 times [2025-04-30 10:31:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:38,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776400643] [2025-04-30 10:31:38,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:38,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-30 10:31:38,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-30 10:31:38,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:38,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:31:38,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:38,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776400643] [2025-04-30 10:31:38,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776400643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:38,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:38,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284691551] [2025-04-30 10:31:38,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:38,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:38,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:38,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:38,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:38,744 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2025-04-30 10:31:38,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 504 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-30 10:31:38,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:38,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2025-04-30 10:31:38,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:39,405 INFO L116 PetriNetUnfolderBase]: 1121/8023 cut-off events. [2025-04-30 10:31:39,406 INFO L117 PetriNetUnfolderBase]: For 8427/8579 co-relation queries the response was YES. [2025-04-30 10:31:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15946 conditions, 8023 events. 1121/8023 cut-off events. For 8427/8579 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 96593 event pairs, 707 based on Foata normal form. 4/7570 useless extension candidates. Maximal degree in co-relation 12796. Up to 2095 conditions per place. [2025-04-30 10:31:39,443 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-04-30 10:31:39,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 162 transitions, 609 flow [2025-04-30 10:31:39,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-04-30 10:31:39,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8927738927738927 [2025-04-30 10:31:39,444 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 504 flow. Second operand 3 states and 383 transitions. [2025-04-30 10:31:39,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 162 transitions, 609 flow [2025-04-30 10:31:39,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 162 transitions, 595 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:39,451 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 532 flow [2025-04-30 10:31:39,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2025-04-30 10:31:39,451 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 16 predicate places. [2025-04-30 10:31:39,451 INFO L485 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 532 flow [2025-04-30 10:31:39,452 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-30 10:31:39,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:39,452 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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-30 10:31:39,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-30 10:31:39,452 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:39,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -895027030, now seen corresponding path program 1 times [2025-04-30 10:31:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:39,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965450148] [2025-04-30 10:31:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:39,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-30 10:31:39,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-30 10:31:39,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:39,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:31:39,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:39,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965450148] [2025-04-30 10:31:39,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965450148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:39,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:39,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:31:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455017868] [2025-04-30 10:31:39,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:39,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:31:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:39,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:31:39,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:31:39,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 143 [2025-04-30 10:31:39,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 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-30 10:31:39,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:39,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 143 [2025-04-30 10:31:39,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:40,724 INFO L116 PetriNetUnfolderBase]: 2202/9523 cut-off events. [2025-04-30 10:31:40,725 INFO L117 PetriNetUnfolderBase]: For 4892/5050 co-relation queries the response was YES. [2025-04-30 10:31:40,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18105 conditions, 9523 events. 2202/9523 cut-off events. For 4892/5050 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 99031 event pairs, 429 based on Foata normal form. 110/9413 useless extension candidates. Maximal degree in co-relation 8701. Up to 1508 conditions per place. [2025-04-30 10:31:40,766 INFO L140 encePairwiseOnDemand]: 129/143 looper letters, 82 selfloop transitions, 15 changer transitions 21/241 dead transitions. [2025-04-30 10:31:40,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 241 transitions, 1017 flow [2025-04-30 10:31:40,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:31:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:31:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1536 transitions. [2025-04-30 10:31:40,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8262506724045185 [2025-04-30 10:31:40,768 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 532 flow. Second operand 13 states and 1536 transitions. [2025-04-30 10:31:40,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 241 transitions, 1017 flow [2025-04-30 10:31:40,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 241 transitions, 1001 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:40,776 INFO L231 Difference]: Finished difference. Result has 182 places, 166 transitions, 608 flow [2025-04-30 10:31:40,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=608, PETRI_PLACES=182, PETRI_TRANSITIONS=166} [2025-04-30 10:31:40,776 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 35 predicate places. [2025-04-30 10:31:40,776 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 166 transitions, 608 flow [2025-04-30 10:31:40,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 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-30 10:31:40,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:40,777 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:40,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-30 10:31:40,777 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:40,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 443476877, now seen corresponding path program 1 times [2025-04-30 10:31:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:40,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794530204] [2025-04-30 10:31:40,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:31:40,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:31:40,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:40,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:40,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:40,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:31:40,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:31:40,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:40,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:40,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:40,820 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:40,820 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-30 10:31:40,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-30 10:31:40,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-30 10:31:40,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-30 10:31:40,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-30 10:31:40,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-30 10:31:40,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-30 10:31:40,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-30 10:31:40,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-30 10:31:40,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-30 10:31:40,821 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:40,822 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:40,822 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-30 10:31:40,841 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-30 10:31:40,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 161 transitions, 377 flow [2025-04-30 10:31:40,900 INFO L116 PetriNetUnfolderBase]: 55/1008 cut-off events. [2025-04-30 10:31:40,900 INFO L117 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-04-30 10:31:40,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 1008 events. 55/1008 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4822 event pairs, 23 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 616. Up to 80 conditions per place. [2025-04-30 10:31:40,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 161 transitions, 377 flow [2025-04-30 10:31:40,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 161 transitions, 377 flow [2025-04-30 10:31:40,907 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:40,907 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;@1ace8bd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:40,908 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-30 10:31:40,909 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:40,909 INFO L116 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-04-30 10:31:40,909 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:40,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:40,909 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] [2025-04-30 10:31:40,909 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-04-30 10:31:40,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1536015329, now seen corresponding path program 1 times [2025-04-30 10:31:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:40,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083834307] [2025-04-30 10:31:40,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:40,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:31:40,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:31:40,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:40,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:40,924 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-30 10:31:40,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:40,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083834307] [2025-04-30 10:31:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083834307] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:40,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:40,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:40,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821984284] [2025-04-30 10:31:40,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:40,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:40,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:40,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:40,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 161 [2025-04-30 10:31:40,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 377 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-30 10:31:40,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:40,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 161 [2025-04-30 10:31:40,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand