./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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 ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.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 729ea5b7f047316231f562bf88a66f84bb913811f2b458cb706ab3ed78d2b3a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:58:37,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:58:37,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:58:37,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:58:37,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:58:37,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:58:37,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:58:37,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:58:37,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:58:37,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:58:37,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:58:37,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:58:37,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:58:37,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:58:37,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:58:37,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:58:37,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:58:37,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:58:37,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:58:37,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:58:37,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:58:37,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:58:37,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:58:37,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:58:37,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:58:37,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:58:37,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:58:37,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:58:37,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:58:37,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:58:37,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:58:37,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:58:37,229 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 -> 729ea5b7f047316231f562bf88a66f84bb913811f2b458cb706ab3ed78d2b3a0 [2025-03-04 06:58:37,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:58:37,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:58:37,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:58:37,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:58:37,489 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:58:37,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i [2025-03-04 06:58:38,592 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7f7f4f3/1b0f01a8449b4260b557781e7ebd0024/FLAGccf8b6cf3 [2025-03-04 06:58:38,840 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:58:38,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i [2025-03-04 06:58:38,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7f7f4f3/1b0f01a8449b4260b557781e7ebd0024/FLAGccf8b6cf3 [2025-03-04 06:58:39,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7f7f4f3/1b0f01a8449b4260b557781e7ebd0024 [2025-03-04 06:58:39,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:58:39,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:58:39,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:58:39,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:58:39,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:58:39,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39, skipping insertion in model container [2025-03-04 06:58:39,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:58:39,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:58:39,468 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:58:39,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:58:39,561 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:58:39,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39 WrapperNode [2025-03-04 06:58:39,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:58:39,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:58:39,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:58:39,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:58:39,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,605 INFO L138 Inliner]: procedures = 277, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-03-04 06:58:39,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:58:39,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:58:39,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:58:39,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:58:39,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:58:39,637 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:58:39,637 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:58:39,637 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:58:39,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (1/1) ... [2025-03-04 06:58:39,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:58:39,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:58:39,662 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-03-04 06:58:39,668 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-03-04 06:58:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:58:39,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:58:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:58:39,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:58:39,687 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:58:39,783 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:58:39,784 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:58:39,981 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:58:39,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:58:39,994 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:58:39,996 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:58:39,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:58:39 BoogieIcfgContainer [2025-03-04 06:58:39,997 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:58:39,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:58:39,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:58:40,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:58:40,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:58:39" (1/3) ... [2025-03-04 06:58:40,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f37b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:58:40, skipping insertion in model container [2025-03-04 06:58:40,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:39" (2/3) ... [2025-03-04 06:58:40,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f37b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:58:40, skipping insertion in model container [2025-03-04 06:58:40,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:58:39" (3/3) ... [2025-03-04 06:58:40,006 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race-2.i [2025-03-04 06:58:40,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:58:40,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-inc-race-2.i that has 2 procedures, 119 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-04 06:58:40,021 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:58:40,078 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:58:40,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 121 transitions, 249 flow [2025-03-04 06:58:40,163 INFO L124 PetriNetUnfolderBase]: 2/154 cut-off events. [2025-03-04 06:58:40,164 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:58:40,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 154 events. 2/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 246 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2025-03-04 06:58:40,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 121 transitions, 249 flow [2025-03-04 06:58:40,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 121 transitions, 249 flow [2025-03-04 06:58:40,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:58:40,189 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8083bce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:58:40,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 06:58:40,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:58:40,197 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-03-04 06:58:40,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:58:40,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:40,199 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] [2025-03-04 06:58:40,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash 873849706, now seen corresponding path program 1 times [2025-03-04 06:58:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:40,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-04 06:58:40,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:40,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:58:40,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:58:40,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:40,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:40,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:40,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-04 06:58:40,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407292550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:40,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:40,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533685110] [2025-03-04 06:58:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:40,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:40,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:40,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:40,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2025-03-04 06:58:40,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-03-04 06:58:40,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:40,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2025-03-04 06:58:40,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:40,511 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-03-04 06:58:40,512 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:58:40,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 230 events. 7/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 587 event pairs, 6 based on Foata normal form. 1/203 useless extension candidates. Maximal degree in co-relation 172. Up to 25 conditions per place. [2025-03-04 06:58:40,516 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 10 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2025-03-04 06:58:40,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 119 transitions, 269 flow [2025-03-04 06:58:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-03-04 06:58:40,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228650137741047 [2025-03-04 06:58:40,529 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 249 flow. Second operand 3 states and 335 transitions. [2025-03-04 06:58:40,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 119 transitions, 269 flow [2025-03-04 06:58:40,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:40,537 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 247 flow [2025-03-04 06:58:40,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-03-04 06:58:40,541 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2025-03-04 06:58:40,541 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 247 flow [2025-03-04 06:58:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-03-04 06:58:40,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:40,542 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] [2025-03-04 06:58:40,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:58:40,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:40,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash 680914424, now seen corresponding path program 1 times [2025-03-04 06:58:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:40,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-03-04 06:58:40,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:40,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:58:40,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:58:40,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:40,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:40,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-03-04 06:58:40,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244088520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:40,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:40,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:40,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197662874] [2025-03-04 06:58:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:40,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:40,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:40,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:40,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:40,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-03-04 06:58:40,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-03-04 06:58:40,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:40,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-03-04 06:58:40,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:40,688 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2025-03-04 06:58:40,688 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:58:40,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 220 events. 9/220 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 512 event pairs, 3 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 217. Up to 24 conditions per place. [2025-03-04 06:58:40,689 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 11 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2025-03-04 06:58:40,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 277 flow [2025-03-04 06:58:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-04 06:58:40,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2025-03-04 06:58:40,694 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 247 flow. Second operand 3 states and 342 transitions. [2025-03-04 06:58:40,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 277 flow [2025-03-04 06:58:40,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:40,698 INFO L231 Difference]: Finished difference. Result has 121 places, 118 transitions, 253 flow [2025-03-04 06:58:40,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=121, PETRI_TRANSITIONS=118} [2025-03-04 06:58:40,699 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2025-03-04 06:58:40,700 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 253 flow [2025-03-04 06:58:40,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-03-04 06:58:40,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:40,700 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] [2025-03-04 06:58:40,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:58:40,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:40,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash 668431536, now seen corresponding path program 1 times [2025-03-04 06:58:40,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:40,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913759971] [2025-03-04 06:58:40,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:40,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:40,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:40,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:40,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913759971] [2025-03-04 06:58:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913759971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:41,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46840809] [2025-03-04 06:58:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:41,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:41,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:41,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:41,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:41,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 121 [2025-03-04 06:58:41,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 253 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-03-04 06:58:41,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:41,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 121 [2025-03-04 06:58:41,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:41,467 INFO L124 PetriNetUnfolderBase]: 100/685 cut-off events. [2025-03-04 06:58:41,467 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:58:41,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 685 events. 100/685 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3769 event pairs, 52 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 850. Up to 195 conditions per place. [2025-03-04 06:58:41,474 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 33 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-03-04 06:58:41,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 147 transitions, 421 flow [2025-03-04 06:58:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2025-03-04 06:58:41,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539944903581267 [2025-03-04 06:58:41,478 INFO L175 Difference]: Start difference. First operand has 121 places, 118 transitions, 253 flow. Second operand 6 states and 620 transitions. [2025-03-04 06:58:41,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 147 transitions, 421 flow [2025-03-04 06:58:41,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 147 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:41,483 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 403 flow [2025-03-04 06:58:41,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2025-03-04 06:58:41,484 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2025-03-04 06:58:41,484 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 403 flow [2025-03-04 06:58:41,485 INFO L472 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-03-04 06:58:41,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:41,485 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] [2025-03-04 06:58:41,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:58:41,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:41,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1494456039, now seen corresponding path program 1 times [2025-03-04 06:58:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-03-04 06:58:41,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:41,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:41,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:41,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:41,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-03-04 06:58:41,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036216619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:41,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:41,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631882211] [2025-03-04 06:58:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:41,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:41,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:41,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:41,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 121 [2025-03-04 06:58:41,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:41,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:41,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 121 [2025-03-04 06:58:41,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:41,703 INFO L124 PetriNetUnfolderBase]: 48/376 cut-off events. [2025-03-04 06:58:41,703 INFO L125 PetriNetUnfolderBase]: For 38/48 co-relation queries the response was YES. [2025-03-04 06:58:41,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 376 events. 48/376 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1461 event pairs, 6 based on Foata normal form. 1/354 useless extension candidates. Maximal degree in co-relation 489. Up to 53 conditions per place. [2025-03-04 06:58:41,705 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 15 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2025-03-04 06:58:41,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 146 transitions, 461 flow [2025-03-04 06:58:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-03-04 06:58:41,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8994490358126722 [2025-03-04 06:58:41,709 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 403 flow. Second operand 6 states and 653 transitions. [2025-03-04 06:58:41,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 146 transitions, 461 flow [2025-03-04 06:58:41,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 146 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:41,715 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 421 flow [2025-03-04 06:58:41,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-03-04 06:58:41,717 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 18 predicate places. [2025-03-04 06:58:41,717 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 421 flow [2025-03-04 06:58:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:41,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:41,717 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] [2025-03-04 06:58:41,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:58:41,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:41,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash -307367179, now seen corresponding path program 1 times [2025-03-04 06:58:41,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961421627] [2025-03-04 06:58:41,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:41,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:58:41,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:58:41,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:41,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:41,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:41,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961421627] [2025-03-04 06:58:41,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961421627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:41,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:41,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502740808] [2025-03-04 06:58:41,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:41,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:41,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:41,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:41,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:41,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-03-04 06:58:41,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-03-04 06:58:41,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:41,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-03-04 06:58:41,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:41,807 INFO L124 PetriNetUnfolderBase]: 24/266 cut-off events. [2025-03-04 06:58:41,808 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-03-04 06:58:41,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 266 events. 24/266 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 871 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 360. Up to 49 conditions per place. [2025-03-04 06:58:41,810 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 7 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-03-04 06:58:41,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 137 transitions, 435 flow [2025-03-04 06:58:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-04 06:58:41,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-03-04 06:58:41,813 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 421 flow. Second operand 3 states and 338 transitions. [2025-03-04 06:58:41,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 137 transitions, 435 flow [2025-03-04 06:58:41,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 421 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 06:58:41,819 INFO L231 Difference]: Finished difference. Result has 132 places, 137 transitions, 407 flow [2025-03-04 06:58:41,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=137} [2025-03-04 06:58:41,819 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2025-03-04 06:58:41,820 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 407 flow [2025-03-04 06:58:41,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-03-04 06:58:41,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:41,821 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-03-04 06:58:41,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:58:41,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:41,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1238309190, now seen corresponding path program 1 times [2025-03-04 06:58:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-03-04 06:58:41,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:41,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:58:41,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:58:41,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:41,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-03-04 06:58:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587885377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:41,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609819172] [2025-03-04 06:58:41,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:41,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:41,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:41,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:41,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-03-04 06:58:41,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-03-04 06:58:41,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:41,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-03-04 06:58:41,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:41,925 INFO L124 PetriNetUnfolderBase]: 24/265 cut-off events. [2025-03-04 06:58:41,925 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-03-04 06:58:41,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 265 events. 24/265 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 866 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 349. Up to 49 conditions per place. [2025-03-04 06:58:41,926 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 8 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-03-04 06:58:41,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 425 flow [2025-03-04 06:58:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-04 06:58:41,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-03-04 06:58:41,928 INFO L175 Difference]: Start difference. First operand has 132 places, 137 transitions, 407 flow. Second operand 3 states and 338 transitions. [2025-03-04 06:58:41,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 425 flow [2025-03-04 06:58:41,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:41,931 INFO L231 Difference]: Finished difference. Result has 131 places, 136 transitions, 405 flow [2025-03-04 06:58:41,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=131, PETRI_TRANSITIONS=136} [2025-03-04 06:58:41,931 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2025-03-04 06:58:41,931 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 405 flow [2025-03-04 06:58:41,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-03-04 06:58:41,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:41,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:41,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:58:41,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:41,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1952550955, now seen corresponding path program 1 times [2025-03-04 06:58:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333179234] [2025-03-04 06:58:41,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:41,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:58:41,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:58:41,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:41,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:42,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:42,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333179234] [2025-03-04 06:58:42,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333179234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:42,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:42,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:42,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067467065] [2025-03-04 06:58:42,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:42,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:42,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:42,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:42,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:42,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 121 [2025-03-04 06:58:42,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 405 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-03-04 06:58:42,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:42,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 121 [2025-03-04 06:58:42,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:42,403 INFO L124 PetriNetUnfolderBase]: 104/614 cut-off events. [2025-03-04 06:58:42,403 INFO L125 PetriNetUnfolderBase]: For 107/109 co-relation queries the response was YES. [2025-03-04 06:58:42,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 614 events. 104/614 cut-off events. For 107/109 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3260 event pairs, 26 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1017. Up to 203 conditions per place. [2025-03-04 06:58:42,406 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 48 selfloop transitions, 21 changer transitions 7/166 dead transitions. [2025-03-04 06:58:42,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 166 transitions, 646 flow [2025-03-04 06:58:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-03-04 06:58:42,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8691460055096418 [2025-03-04 06:58:42,407 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 405 flow. Second operand 6 states and 631 transitions. [2025-03-04 06:58:42,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 166 transitions, 646 flow [2025-03-04 06:58:42,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 166 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:42,410 INFO L231 Difference]: Finished difference. Result has 139 places, 151 transitions, 562 flow [2025-03-04 06:58:42,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=139, PETRI_TRANSITIONS=151} [2025-03-04 06:58:42,411 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2025-03-04 06:58:42,411 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 151 transitions, 562 flow [2025-03-04 06:58:42,412 INFO L472 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-03-04 06:58:42,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:42,412 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] [2025-03-04 06:58:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:58:42,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash 562581900, now seen corresponding path program 1 times [2025-03-04 06:58:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704941539] [2025-03-04 06:58:42,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:42,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:58:42,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:58:42,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:42,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:58:42,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:58:42,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:58:42,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:58:42,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:42,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:58:42,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:58:42,462 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:58:42,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-04 06:58:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-04 06:58:42,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-04 06:58:42,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-04 06:58:42,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-04 06:58:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:58:42,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:42,469 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:58:42,469 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:58:42,490 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:58:42,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 161 transitions, 338 flow [2025-03-04 06:58:42,516 INFO L124 PetriNetUnfolderBase]: 4/262 cut-off events. [2025-03-04 06:58:42,516 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-04 06:58:42,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 262 events. 4/262 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 623 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 156. Up to 6 conditions per place. [2025-03-04 06:58:42,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 161 transitions, 338 flow [2025-03-04 06:58:42,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 161 transitions, 338 flow [2025-03-04 06:58:42,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:58:42,520 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8083bce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:58:42,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 06:58:42,523 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:58:42,523 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-03-04 06:58:42,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:58:42,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:42,523 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] [2025-03-04 06:58:42,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 394213931, now seen corresponding path program 1 times [2025-03-04 06:58:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297471998] [2025-03-04 06:58:42,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:42,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:58:42,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:58:42,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:42,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297471998] [2025-03-04 06:58:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297471998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:42,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:42,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468551683] [2025-03-04 06:58:42,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:42,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:42,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:42,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:42,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:58:42,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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-03-04 06:58:42,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:42,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:58:42,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:42,643 INFO L124 PetriNetUnfolderBase]: 81/1022 cut-off events. [2025-03-04 06:58:42,644 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 06:58:42,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1022 events. 81/1022 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6420 event pairs, 78 based on Foata normal form. 1/888 useless extension candidates. Maximal degree in co-relation 874. Up to 162 conditions per place. [2025-03-04 06:58:42,650 INFO L140 encePairwiseOnDemand]: 157/161 looper letters, 15 selfloop transitions, 2 changer transitions 1/159 dead transitions. [2025-03-04 06:58:42,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 368 flow [2025-03-04 06:58:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-03-04 06:58:42,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213250517598344 [2025-03-04 06:58:42,651 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 338 flow. Second operand 3 states and 445 transitions. [2025-03-04 06:58:42,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 368 flow [2025-03-04 06:58:42,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 159 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:42,653 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 336 flow [2025-03-04 06:58:42,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2025-03-04 06:58:42,654 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 1 predicate places. [2025-03-04 06:58:42,654 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 336 flow [2025-03-04 06:58:42,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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-03-04 06:58:42,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:42,654 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] [2025-03-04 06:58:42,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:58:42,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:42,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash -295435112, now seen corresponding path program 1 times [2025-03-04 06:58:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926612878] [2025-03-04 06:58:42,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:42,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:58:42,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:58:42,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:42,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:42,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926612878] [2025-03-04 06:58:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926612878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:42,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093577098] [2025-03-04 06:58:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:42,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:42,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:42,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:42,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:42,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:58:42,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-03-04 06:58:42,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:42,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:58:42,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:42,783 INFO L124 PetriNetUnfolderBase]: 132/1100 cut-off events. [2025-03-04 06:58:42,783 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 06:58:42,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1100 events. 132/1100 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6970 event pairs, 61 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1342. Up to 227 conditions per place. [2025-03-04 06:58:42,791 INFO L140 encePairwiseOnDemand]: 155/161 looper letters, 20 selfloop transitions, 3 changer transitions 0/163 dead transitions. [2025-03-04 06:58:42,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 163 transitions, 397 flow [2025-03-04 06:58:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2025-03-04 06:58:42,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2025-03-04 06:58:42,793 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 336 flow. Second operand 3 states and 452 transitions. [2025-03-04 06:58:42,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 163 transitions, 397 flow [2025-03-04 06:58:42,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:42,795 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 347 flow [2025-03-04 06:58:42,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-03-04 06:58:42,796 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -2 predicate places. [2025-03-04 06:58:42,796 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 347 flow [2025-03-04 06:58:42,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-03-04 06:58:42,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:42,797 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] [2025-03-04 06:58:42,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:58:42,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1300596880, now seen corresponding path program 1 times [2025-03-04 06:58:42,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:42,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-03-04 06:58:42,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:42,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:42,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:42,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:42,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:42,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-03-04 06:58:42,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:42,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-03-04 06:58:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137533605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:42,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:42,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:42,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703482803] [2025-03-04 06:58:42,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:42,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:42,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:42,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:42,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:43,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 161 [2025-03-04 06:58:43,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 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-03-04 06:58:43,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:43,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 161 [2025-03-04 06:58:43,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:43,717 INFO L124 PetriNetUnfolderBase]: 1885/6101 cut-off events. [2025-03-04 06:58:43,718 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-04 06:58:43,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9490 conditions, 6101 events. 1885/6101 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 56893 event pairs, 933 based on Foata normal form. 0/5505 useless extension candidates. Maximal degree in co-relation 5970. Up to 2653 conditions per place. [2025-03-04 06:58:43,746 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 50 selfloop transitions, 38 changer transitions 0/212 dead transitions. [2025-03-04 06:58:43,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 212 transitions, 636 flow [2025-03-04 06:58:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2025-03-04 06:58:43,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8747412008281573 [2025-03-04 06:58:43,748 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 347 flow. Second operand 6 states and 845 transitions. [2025-03-04 06:58:43,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 212 transitions, 636 flow [2025-03-04 06:58:43,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 212 transitions, 636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:43,752 INFO L231 Difference]: Finished difference. Result has 171 places, 195 transitions, 601 flow [2025-03-04 06:58:43,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=171, PETRI_TRANSITIONS=195} [2025-03-04 06:58:43,753 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 8 predicate places. [2025-03-04 06:58:43,754 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 195 transitions, 601 flow [2025-03-04 06:58:43,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 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-03-04 06:58:43,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:43,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] [2025-03-04 06:58:43,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:58:43,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:43,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash -474572377, now seen corresponding path program 1 times [2025-03-04 06:58:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949401269] [2025-03-04 06:58:43,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:43,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949401269] [2025-03-04 06:58:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949401269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562532057] [2025-03-04 06:58:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:43,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:43,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:43,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 161 [2025-03-04 06:58:43,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 195 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:43,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:43,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 161 [2025-03-04 06:58:43,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:44,255 INFO L124 PetriNetUnfolderBase]: 798/3928 cut-off events. [2025-03-04 06:58:44,255 INFO L125 PetriNetUnfolderBase]: For 449/680 co-relation queries the response was YES. [2025-03-04 06:58:44,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6350 conditions, 3928 events. 798/3928 cut-off events. For 449/680 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 35103 event pairs, 305 based on Foata normal form. 2/3565 useless extension candidates. Maximal degree in co-relation 3849. Up to 1048 conditions per place. [2025-03-04 06:58:44,292 INFO L140 encePairwiseOnDemand]: 153/161 looper letters, 20 selfloop transitions, 2 changer transitions 5/203 dead transitions. [2025-03-04 06:58:44,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 203 transitions, 671 flow [2025-03-04 06:58:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-03-04 06:58:44,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-04 06:58:44,295 INFO L175 Difference]: Start difference. First operand has 171 places, 195 transitions, 601 flow. Second operand 6 states and 874 transitions. [2025-03-04 06:58:44,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 203 transitions, 671 flow [2025-03-04 06:58:44,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 203 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:44,302 INFO L231 Difference]: Finished difference. Result has 180 places, 196 transitions, 623 flow [2025-03-04 06:58:44,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=623, PETRI_PLACES=180, PETRI_TRANSITIONS=196} [2025-03-04 06:58:44,303 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 17 predicate places. [2025-03-04 06:58:44,303 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 196 transitions, 623 flow [2025-03-04 06:58:44,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:44,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:44,303 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] [2025-03-04 06:58:44,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:58:44,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:44,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1681716196, now seen corresponding path program 1 times [2025-03-04 06:58:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:44,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846491523] [2025-03-04 06:58:44,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:44,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:44,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:58:44,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:58:44,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:44,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:44,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846491523] [2025-03-04 06:58:44,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846491523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:44,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:44,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:44,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135714428] [2025-03-04 06:58:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:44,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:44,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:44,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:44,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:44,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2025-03-04 06:58:44,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 196 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-03-04 06:58:44,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:44,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2025-03-04 06:58:44,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:44,727 INFO L124 PetriNetUnfolderBase]: 873/3951 cut-off events. [2025-03-04 06:58:44,728 INFO L125 PetriNetUnfolderBase]: For 742/1083 co-relation queries the response was YES. [2025-03-04 06:58:44,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7130 conditions, 3951 events. 873/3951 cut-off events. For 742/1083 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 37719 event pairs, 171 based on Foata normal form. 1/3640 useless extension candidates. Maximal degree in co-relation 7031. Up to 1139 conditions per place. [2025-03-04 06:58:44,746 INFO L140 encePairwiseOnDemand]: 147/161 looper letters, 29 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2025-03-04 06:58:44,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 213 transitions, 746 flow [2025-03-04 06:58:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-04 06:58:44,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461697722567288 [2025-03-04 06:58:44,747 INFO L175 Difference]: Start difference. First operand has 180 places, 196 transitions, 623 flow. Second operand 3 states and 457 transitions. [2025-03-04 06:58:44,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 213 transitions, 746 flow [2025-03-04 06:58:44,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 213 transitions, 734 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 06:58:44,757 INFO L231 Difference]: Finished difference. Result has 177 places, 206 transitions, 699 flow [2025-03-04 06:58:44,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=177, PETRI_TRANSITIONS=206} [2025-03-04 06:58:44,758 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 14 predicate places. [2025-03-04 06:58:44,758 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 206 transitions, 699 flow [2025-03-04 06:58:44,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-03-04 06:58:44,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:44,758 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-03-04 06:58:44,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:58:44,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:44,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2044135777, now seen corresponding path program 1 times [2025-03-04 06:58:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-04 06:58:44,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:44,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:58:44,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:58:44,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:44,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-04 06:58:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:44,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:44,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:44,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312212391] [2025-03-04 06:58:44,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:44,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:44,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:44,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:58:44,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 206 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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-03-04 06:58:44,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:44,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:58:44,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:45,159 INFO L124 PetriNetUnfolderBase]: 969/4505 cut-off events. [2025-03-04 06:58:45,161 INFO L125 PetriNetUnfolderBase]: For 1031/1422 co-relation queries the response was YES. [2025-03-04 06:58:45,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8235 conditions, 4505 events. 969/4505 cut-off events. For 1031/1422 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 44685 event pairs, 189 based on Foata normal form. 9/4161 useless extension candidates. Maximal degree in co-relation 7152. Up to 1280 conditions per place. [2025-03-04 06:58:45,231 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 26 selfloop transitions, 9 changer transitions 0/217 dead transitions. [2025-03-04 06:58:45,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 217 transitions, 815 flow [2025-03-04 06:58:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2025-03-04 06:58:45,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9399585921325052 [2025-03-04 06:58:45,233 INFO L175 Difference]: Start difference. First operand has 177 places, 206 transitions, 699 flow. Second operand 3 states and 454 transitions. [2025-03-04 06:58:45,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 217 transitions, 815 flow [2025-03-04 06:58:45,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 217 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:45,242 INFO L231 Difference]: Finished difference. Result has 179 places, 213 transitions, 755 flow [2025-03-04 06:58:45,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=179, PETRI_TRANSITIONS=213} [2025-03-04 06:58:45,244 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 16 predicate places. [2025-03-04 06:58:45,244 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 213 transitions, 755 flow [2025-03-04 06:58:45,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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-03-04 06:58:45,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:45,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:45,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:58:45,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:45,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash -418793166, now seen corresponding path program 1 times [2025-03-04 06:58:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:45,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633287323] [2025-03-04 06:58:45,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:45,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:58:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:58:45,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:45,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:45,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:45,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633287323] [2025-03-04 06:58:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633287323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:45,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503034255] [2025-03-04 06:58:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:45,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:45,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:45,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:45,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-03-04 06:58:45,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 213 transitions, 755 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 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-03-04 06:58:45,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:45,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-03-04 06:58:45,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:46,643 INFO L124 PetriNetUnfolderBase]: 3463/12362 cut-off events. [2025-03-04 06:58:46,643 INFO L125 PetriNetUnfolderBase]: For 3171/3466 co-relation queries the response was YES. [2025-03-04 06:58:46,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25334 conditions, 12362 events. 3463/12362 cut-off events. For 3171/3466 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 138887 event pairs, 1210 based on Foata normal form. 8/11483 useless extension candidates. Maximal degree in co-relation 23198. Up to 4790 conditions per place. [2025-03-04 06:58:46,728 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 84 selfloop transitions, 38 changer transitions 0/268 dead transitions. [2025-03-04 06:58:46,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 268 transitions, 1179 flow [2025-03-04 06:58:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2025-03-04 06:58:46,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861283643892339 [2025-03-04 06:58:46,732 INFO L175 Difference]: Start difference. First operand has 179 places, 213 transitions, 755 flow. Second operand 6 states and 856 transitions. [2025-03-04 06:58:46,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 268 transitions, 1179 flow [2025-03-04 06:58:46,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 268 transitions, 1161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:46,751 INFO L231 Difference]: Finished difference. Result has 187 places, 250 transitions, 1055 flow [2025-03-04 06:58:46,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=187, PETRI_TRANSITIONS=250} [2025-03-04 06:58:46,752 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 24 predicate places. [2025-03-04 06:58:46,753 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 250 transitions, 1055 flow [2025-03-04 06:58:46,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 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-03-04 06:58:46,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:46,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:46,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:58:46,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:46,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1977511700, now seen corresponding path program 1 times [2025-03-04 06:58:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:46,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323364377] [2025-03-04 06:58:46,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:46,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:58:46,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:58:46,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:46,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:47,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:47,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323364377] [2025-03-04 06:58:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323364377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:47,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:47,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891752481] [2025-03-04 06:58:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:47,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:47,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:47,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-03-04 06:58:47,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 250 transitions, 1055 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 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-03-04 06:58:47,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:47,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-03-04 06:58:47,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:48,805 INFO L124 PetriNetUnfolderBase]: 6373/20044 cut-off events. [2025-03-04 06:58:48,805 INFO L125 PetriNetUnfolderBase]: For 9911/10230 co-relation queries the response was YES. [2025-03-04 06:58:48,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48823 conditions, 20044 events. 6373/20044 cut-off events. For 9911/10230 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 224567 event pairs, 1628 based on Foata normal form. 12/18655 useless extension candidates. Maximal degree in co-relation 42894. Up to 8149 conditions per place. [2025-03-04 06:58:48,919 INFO L140 encePairwiseOnDemand]: 142/161 looper letters, 139 selfloop transitions, 118 changer transitions 0/405 dead transitions. [2025-03-04 06:58:48,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 405 transitions, 2443 flow [2025-03-04 06:58:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2025-03-04 06:58:48,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-03-04 06:58:48,922 INFO L175 Difference]: Start difference. First operand has 187 places, 250 transitions, 1055 flow. Second operand 6 states and 882 transitions. [2025-03-04 06:58:48,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 405 transitions, 2443 flow [2025-03-04 06:58:48,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 405 transitions, 2311 flow, removed 66 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:48,967 INFO L231 Difference]: Finished difference. Result has 196 places, 362 transitions, 2121 flow [2025-03-04 06:58:48,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2121, PETRI_PLACES=196, PETRI_TRANSITIONS=362} [2025-03-04 06:58:48,967 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 33 predicate places. [2025-03-04 06:58:48,967 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 362 transitions, 2121 flow [2025-03-04 06:58:48,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 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-03-04 06:58:48,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:48,968 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, 1, 1, 1, 1, 1] [2025-03-04 06:58:48,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:58:48,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:48,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2120949239, now seen corresponding path program 1 times [2025-03-04 06:58:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620052631] [2025-03-04 06:58:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:48,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:58:48,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:58:48,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:48,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620052631] [2025-03-04 06:58:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620052631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443696481] [2025-03-04 06:58:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:48,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:48,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:48,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:49,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:58:49,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 362 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:49,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:49,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:58:49,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:50,608 INFO L124 PetriNetUnfolderBase]: 4306/15228 cut-off events. [2025-03-04 06:58:50,608 INFO L125 PetriNetUnfolderBase]: For 11267/13099 co-relation queries the response was YES. [2025-03-04 06:58:50,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41782 conditions, 15228 events. 4306/15228 cut-off events. For 11267/13099 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 173197 event pairs, 356 based on Foata normal form. 12/14543 useless extension candidates. Maximal degree in co-relation 37680. Up to 3717 conditions per place. [2025-03-04 06:58:50,789 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 28 selfloop transitions, 11 changer transitions 0/372 dead transitions. [2025-03-04 06:58:50,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 372 transitions, 2236 flow [2025-03-04 06:58:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2025-03-04 06:58:50,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2025-03-04 06:58:50,791 INFO L175 Difference]: Start difference. First operand has 196 places, 362 transitions, 2121 flow. Second operand 3 states and 453 transitions. [2025-03-04 06:58:50,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 372 transitions, 2236 flow [2025-03-04 06:58:50,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 372 transitions, 2200 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:51,001 INFO L231 Difference]: Finished difference. Result has 200 places, 369 transitions, 2173 flow [2025-03-04 06:58:51,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2173, PETRI_PLACES=200, PETRI_TRANSITIONS=369} [2025-03-04 06:58:51,001 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 37 predicate places. [2025-03-04 06:58:51,001 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 369 transitions, 2173 flow [2025-03-04 06:58:51,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:51,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:51,002 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] [2025-03-04 06:58:51,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:58:51,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:51,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash 174300950, now seen corresponding path program 1 times [2025-03-04 06:58:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:51,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951566321] [2025-03-04 06:58:51,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:51,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:58:51,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:58:51,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:58:51,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:58:51,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:58:51,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:58:51,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:51,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:58:51,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:58:51,037 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:58:51,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-04 06:58:51,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-04 06:58:51,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-04 06:58:51,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-04 06:58:51,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-04 06:58:51,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-04 06:58:51,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-04 06:58:51,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-04 06:58:51,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-04 06:58:51,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:58:51,039 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:51,040 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:58:51,040 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:58:51,063 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:58:51,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 201 transitions, 429 flow [2025-03-04 06:58:51,102 INFO L124 PetriNetUnfolderBase]: 9/421 cut-off events. [2025-03-04 06:58:51,102 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-03-04 06:58:51,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 421 events. 9/421 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1307 event pairs, 1 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2025-03-04 06:58:51,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 201 transitions, 429 flow [2025-03-04 06:58:51,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 201 transitions, 429 flow [2025-03-04 06:58:51,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:58:51,108 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8083bce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:58:51,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 06:58:51,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:58:51,110 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-03-04 06:58:51,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:58:51,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:51,110 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] [2025-03-04 06:58:51,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:58:51,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:51,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1529406996, now seen corresponding path program 1 times [2025-03-04 06:58:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749649798] [2025-03-04 06:58:51,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:51,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:58:51,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:58:51,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:51,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749649798] [2025-03-04 06:58:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749649798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207137433] [2025-03-04 06:58:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:51,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:51,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:51,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:51,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-03-04 06:58:51,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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-03-04 06:58:51,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:51,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-03-04 06:58:51,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:51,631 INFO L124 PetriNetUnfolderBase]: 656/5099 cut-off events. [2025-03-04 06:58:51,631 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2025-03-04 06:58:51,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 5099 events. 656/5099 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 51026 event pairs, 643 based on Foata normal form. 1/4437 useless extension candidates. Maximal degree in co-relation 4712. Up to 1052 conditions per place. [2025-03-04 06:58:51,657 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 20 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2025-03-04 06:58:51,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 199 transitions, 469 flow [2025-03-04 06:58:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-03-04 06:58:51,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2025-03-04 06:58:51,658 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 429 flow. Second operand 3 states and 555 transitions. [2025-03-04 06:58:51,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 199 transitions, 469 flow [2025-03-04 06:58:51,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 199 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:51,661 INFO L231 Difference]: Finished difference. Result has 205 places, 198 transitions, 427 flow [2025-03-04 06:58:51,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=205, PETRI_TRANSITIONS=198} [2025-03-04 06:58:51,661 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 1 predicate places. [2025-03-04 06:58:51,661 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 198 transitions, 427 flow [2025-03-04 06:58:51,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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-03-04 06:58:51,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:51,662 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] [2025-03-04 06:58:51,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:58:51,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:58:51,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash 993264696, now seen corresponding path program 1 times [2025-03-04 06:58:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893535972] [2025-03-04 06:58:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:51,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:58:51,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:58:51,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:51,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:51,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893535972] [2025-03-04 06:58:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893535972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:51,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502123403] [2025-03-04 06:58:51,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:51,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:51,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:51,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:51,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-03-04 06:58:51,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 198 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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-03-04 06:58:51,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:51,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-03-04 06:58:51,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:52,120 INFO L124 PetriNetUnfolderBase]: 1275/6749 cut-off events. [2025-03-04 06:58:52,120 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2025-03-04 06:58:52,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8947 conditions, 6749 events. 1275/6749 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 69064 event pairs, 437 based on Foata normal form. 0/6232 useless extension candidates. Maximal degree in co-relation 8905. Up to 1872 conditions per place. [2025-03-04 06:58:52,160 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 29 selfloop transitions, 4 changer transitions 0/206 dead transitions. [2025-03-04 06:58:52,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 521 flow [2025-03-04 06:58:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2025-03-04 06:58:52,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320066334991708 [2025-03-04 06:58:52,161 INFO L175 Difference]: Start difference. First operand has 205 places, 198 transitions, 427 flow. Second operand 3 states and 562 transitions. [2025-03-04 06:58:52,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 521 flow [2025-03-04 06:58:52,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 206 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:52,164 INFO L231 Difference]: Finished difference. Result has 201 places, 198 transitions, 443 flow [2025-03-04 06:58:52,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=201, PETRI_TRANSITIONS=198} [2025-03-04 06:58:52,164 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -3 predicate places. [2025-03-04 06:58:52,164 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 198 transitions, 443 flow [2025-03-04 06:58:52,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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-03-04 06:58:52,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:52,165 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] [2025-03-04 06:58:52,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:58:52,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:58:52,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash 189343792, now seen corresponding path program 1 times [2025-03-04 06:58:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:52,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514145597] [2025-03-04 06:58:52,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:52,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:52,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:52,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:52,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514145597] [2025-03-04 06:58:52,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514145597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:52,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:52,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065620498] [2025-03-04 06:58:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:52,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:52,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:52,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:52,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201 [2025-03-04 06:58:52,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 198 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 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-03-04 06:58:52,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:52,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201 [2025-03-04 06:58:52,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:58,010 INFO L124 PetriNetUnfolderBase]: 24762/64711 cut-off events. [2025-03-04 06:58:58,010 INFO L125 PetriNetUnfolderBase]: For 2236/2236 co-relation queries the response was YES. [2025-03-04 06:58:58,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102379 conditions, 64711 events. 24762/64711 cut-off events. For 2236/2236 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 804748 event pairs, 14369 based on Foata normal form. 0/58481 useless extension candidates. Maximal degree in co-relation 62909. Up to 30792 conditions per place. [2025-03-04 06:58:58,409 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 67 selfloop transitions, 54 changer transitions 0/277 dead transitions. [2025-03-04 06:58:58,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 277 transitions, 855 flow [2025-03-04 06:58:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2025-03-04 06:58:58,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872305140961857 [2025-03-04 06:58:58,411 INFO L175 Difference]: Start difference. First operand has 201 places, 198 transitions, 443 flow. Second operand 6 states and 1070 transitions. [2025-03-04 06:58:58,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 277 transitions, 855 flow [2025-03-04 06:58:58,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 277 transitions, 855 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:58,415 INFO L231 Difference]: Finished difference. Result has 211 places, 251 transitions, 801 flow [2025-03-04 06:58:58,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=211, PETRI_TRANSITIONS=251} [2025-03-04 06:58:58,416 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 7 predicate places. [2025-03-04 06:58:58,416 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 251 transitions, 801 flow [2025-03-04 06:58:58,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 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-03-04 06:58:58,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:58,417 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] [2025-03-04 06:58:58,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:58:58,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:58:58,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1015368295, now seen corresponding path program 1 times [2025-03-04 06:58:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:58,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428376490] [2025-03-04 06:58:58,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:58,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:58,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:58,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:58,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:58,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428376490] [2025-03-04 06:58:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428376490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117368501] [2025-03-04 06:58:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:58,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:58,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:58,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:58,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-03-04 06:58:58,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 251 transitions, 801 flow. Second operand has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 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-03-04 06:58:58,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:58,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-03-04 06:58:58,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:01,931 INFO L124 PetriNetUnfolderBase]: 10026/35732 cut-off events. [2025-03-04 06:59:01,931 INFO L125 PetriNetUnfolderBase]: For 4884/6337 co-relation queries the response was YES. [2025-03-04 06:59:02,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59626 conditions, 35732 events. 10026/35732 cut-off events. For 4884/6337 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 441710 event pairs, 5453 based on Foata normal form. 1/32504 useless extension candidates. Maximal degree in co-relation 29058. Up to 12805 conditions per place. [2025-03-04 06:59:02,179 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 24 selfloop transitions, 2 changer transitions 5/259 dead transitions. [2025-03-04 06:59:02,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 259 transitions, 879 flow [2025-03-04 06:59:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2025-03-04 06:59:02,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071310116086235 [2025-03-04 06:59:02,181 INFO L175 Difference]: Start difference. First operand has 211 places, 251 transitions, 801 flow. Second operand 6 states and 1094 transitions. [2025-03-04 06:59:02,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 259 transitions, 879 flow [2025-03-04 06:59:02,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 259 transitions, 879 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:02,210 INFO L231 Difference]: Finished difference. Result has 220 places, 252 transitions, 823 flow [2025-03-04 06:59:02,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=220, PETRI_TRANSITIONS=252} [2025-03-04 06:59:02,211 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 16 predicate places. [2025-03-04 06:59:02,211 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 252 transitions, 823 flow [2025-03-04 06:59:02,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 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-03-04 06:59:02,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:02,211 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] [2025-03-04 06:59:02,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:59:02,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:02,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1649493227, now seen corresponding path program 1 times [2025-03-04 06:59:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980566792] [2025-03-04 06:59:02,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:02,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:59:02,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:59:02,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:02,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:02,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980566792] [2025-03-04 06:59:02,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980566792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:02,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:02,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062404088] [2025-03-04 06:59:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:02,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:02,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:02,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:02,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2025-03-04 06:59:02,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 252 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 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-03-04 06:59:02,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:02,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2025-03-04 06:59:02,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:09,340 INFO L124 PetriNetUnfolderBase]: 20401/68963 cut-off events. [2025-03-04 06:59:09,340 INFO L125 PetriNetUnfolderBase]: For 17257/21258 co-relation queries the response was YES. [2025-03-04 06:59:09,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127316 conditions, 68963 events. 20401/68963 cut-off events. For 17257/21258 co-relation queries the response was YES. Maximal size of possible extension queue 2232. Compared 976593 event pairs, 5989 based on Foata normal form. 13/63354 useless extension candidates. Maximal degree in co-relation 127216. Up to 22357 conditions per place. [2025-03-04 06:59:10,017 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 44 selfloop transitions, 15 changer transitions 0/278 dead transitions. [2025-03-04 06:59:10,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 278 transitions, 1014 flow [2025-03-04 06:59:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2025-03-04 06:59:10,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386401326699834 [2025-03-04 06:59:10,018 INFO L175 Difference]: Start difference. First operand has 220 places, 252 transitions, 823 flow. Second operand 3 states and 566 transitions. [2025-03-04 06:59:10,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 278 transitions, 1014 flow [2025-03-04 06:59:10,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 278 transitions, 1002 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 06:59:10,549 INFO L231 Difference]: Finished difference. Result has 217 places, 267 transitions, 943 flow [2025-03-04 06:59:10,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=943, PETRI_PLACES=217, PETRI_TRANSITIONS=267} [2025-03-04 06:59:10,549 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 13 predicate places. [2025-03-04 06:59:10,549 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 267 transitions, 943 flow [2025-03-04 06:59:10,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 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-03-04 06:59:10,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:10,550 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-03-04 06:59:10,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:59:10,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:10,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash 976657840, now seen corresponding path program 1 times [2025-03-04 06:59:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:10,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973493499] [2025-03-04 06:59:10,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:10,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:59:10,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:59:10,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:10,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:10,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973493499] [2025-03-04 06:59:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973493499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713273455] [2025-03-04 06:59:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:10,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:10,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:10,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:10,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-03-04 06:59:10,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 267 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:10,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:10,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-03-04 06:59:10,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:19,356 INFO L124 PetriNetUnfolderBase]: 24088/85567 cut-off events. [2025-03-04 06:59:19,356 INFO L125 PetriNetUnfolderBase]: For 25217/30574 co-relation queries the response was YES. [2025-03-04 06:59:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160422 conditions, 85567 events. 24088/85567 cut-off events. For 25217/30574 co-relation queries the response was YES. Maximal size of possible extension queue 2810. Compared 1275505 event pairs, 7096 based on Foata normal form. 168/79026 useless extension candidates. Maximal degree in co-relation 132165. Up to 27395 conditions per place. [2025-03-04 06:59:20,315 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 40 selfloop transitions, 16 changer transitions 0/289 dead transitions. [2025-03-04 06:59:20,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 289 transitions, 1153 flow [2025-03-04 06:59:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-03-04 06:59:20,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2025-03-04 06:59:20,317 INFO L175 Difference]: Start difference. First operand has 217 places, 267 transitions, 943 flow. Second operand 3 states and 567 transitions. [2025-03-04 06:59:20,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 289 transitions, 1153 flow [2025-03-04 06:59:21,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 289 transitions, 1111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:21,139 INFO L231 Difference]: Finished difference. Result has 219 places, 281 transitions, 1059 flow [2025-03-04 06:59:21,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=219, PETRI_TRANSITIONS=281} [2025-03-04 06:59:21,139 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 15 predicate places. [2025-03-04 06:59:21,139 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 281 transitions, 1059 flow [2025-03-04 06:59:21,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:21,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:21,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:21,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:59:21,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:21,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:21,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1957678177, now seen corresponding path program 1 times [2025-03-04 06:59:21,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:21,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642935899] [2025-03-04 06:59:21,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:21,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:59:21,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:59:21,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:21,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:59:21,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:21,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642935899] [2025-03-04 06:59:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642935899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:21,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807395681] [2025-03-04 06:59:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:21,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:21,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:21,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:21,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 201 [2025-03-04 06:59:21,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 281 transitions, 1059 flow. Second operand has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 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-03-04 06:59:21,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:21,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 201 [2025-03-04 06:59:21,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand