./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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-ext/11_fmaxsymopt-race.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 c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:58:59,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:59:00,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:59:00,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:59:00,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:59:00,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:59:00,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:59:00,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:59:00,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:59:00,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:59:00,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:59:00,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:59:00,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:59:00,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:59:00,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:59:00,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:59:00,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:59:00,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:59:00,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:59:00,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:59:00,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:00,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:59:00,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:59:00,068 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 -> c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd [2025-03-13 21:59:00,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:59:00,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:59:00,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:59:00,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:59:00,297 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:59:00,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-03-13 21:59:01,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f965f4c87/2b7aba4a6b0749a68701a61a640af8be/FLAG6c7a118d5 [2025-03-13 21:59:01,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:59:01,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-03-13 21:59:01,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f965f4c87/2b7aba4a6b0749a68701a61a640af8be/FLAG6c7a118d5 [2025-03-13 21:59:02,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f965f4c87/2b7aba4a6b0749a68701a61a640af8be [2025-03-13 21:59:02,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:59:02,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:59:02,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:02,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:59:02,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:59:02,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0db051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02, skipping insertion in model container [2025-03-13 21:59:02,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:59:02,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:02,340 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:59:02,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:02,405 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:59:02,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02 WrapperNode [2025-03-13 21:59:02,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:02,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:02,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:59:02,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:59:02,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,434 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2025-03-13 21:59:02,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:02,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:59:02,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:59:02,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:59:02,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:59:02,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:59:02,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:59:02,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:59:02,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (1/1) ... [2025-03-13 21:59:02,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:02,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:02,483 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-13 21:59:02,488 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-13 21:59:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:59:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:59:02,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:59:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:59:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:59:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:59:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:59:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:59:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:59:02,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:59:02,503 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:59:02,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:59:02,604 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:59:02,820 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:59:02,821 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:59:02,823 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:59:02,844 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:59:02,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:02 BoogieIcfgContainer [2025-03-13 21:59:02,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:59:02,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:59:02,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:59:02,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:59:02,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:59:02" (1/3) ... [2025-03-13 21:59:02,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a61898b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:02, skipping insertion in model container [2025-03-13 21:59:02,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:02" (2/3) ... [2025-03-13 21:59:02,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a61898b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:02, skipping insertion in model container [2025-03-13 21:59:02,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:02" (3/3) ... [2025-03-13 21:59:02,854 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-race.i [2025-03-13 21:59:02,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:59:02,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-race.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-13 21:59:02,869 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:59:02,938 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 122 transitions, 248 flow [2025-03-13 21:59:03,017 INFO L124 PetriNetUnfolderBase]: 8/129 cut-off events. [2025-03-13 21:59:03,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:03,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 129 events. 8/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-13 21:59:03,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 122 transitions, 248 flow [2025-03-13 21:59:03,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 122 transitions, 248 flow [2025-03-13 21:59:03,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:03,047 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;@3012563f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:03,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 21:59:03,067 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:03,067 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:03,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:03,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:03,068 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] [2025-03-13 21:59:03,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:59:03,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash 242270650, now seen corresponding path program 1 times [2025-03-13 21:59:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270105105] [2025-03-13 21:59:03,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:03,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:03,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:03,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:03,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:03,774 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-13 21:59:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270105105] [2025-03-13 21:59:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270105105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493941298] [2025-03-13 21:59:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:03,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:03,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:03,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:03,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2025-03-13 21:59:03,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 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-13 21:59:03,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:03,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2025-03-13 21:59:03,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:04,019 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-13 21:59:04,019 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:59:04,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 0 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 75. Up to 14 conditions per place. [2025-03-13 21:59:04,021 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 13 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-03-13 21:59:04,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 264 flow [2025-03-13 21:59:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-03-13 21:59:04,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265027322404371 [2025-03-13 21:59:04,036 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 248 flow. Second operand 6 states and 605 transitions. [2025-03-13 21:59:04,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 264 flow [2025-03-13 21:59:04,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:04,043 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 238 flow [2025-03-13 21:59:04,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-03-13 21:59:04,050 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-13 21:59:04,050 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 238 flow [2025-03-13 21:59:04,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 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-13 21:59:04,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:04,051 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:59:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:59:04,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:59:04,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1896431640, now seen corresponding path program 1 times [2025-03-13 21:59:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:04,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052448816] [2025-03-13 21:59:04,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:04,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:59:04,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:59:04,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:04,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:04,089 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-13 21:59:04,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:04,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052448816] [2025-03-13 21:59:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052448816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:04,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:04,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:04,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846437878] [2025-03-13 21:59:04,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:04,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:04,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:04,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:04,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 122 [2025-03-13 21:59:04,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-13 21:59:04,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:04,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 122 [2025-03-13 21:59:04,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:04,140 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events. [2025-03-13 21:59:04,142 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:59:04,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 127 events. 5/127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 9 conditions per place. [2025-03-13 21:59:04,143 INFO L140 encePairwiseOnDemand]: 119/122 looper letters, 7 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-13 21:59:04,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 260 flow [2025-03-13 21:59:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-03-13 21:59:04,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912568306010929 [2025-03-13 21:59:04,144 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 238 flow. Second operand 3 states and 334 transitions. [2025-03-13 21:59:04,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 260 flow [2025-03-13 21:59:04,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:04,149 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 240 flow [2025-03-13 21:59:04,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-03-13 21:59:04,150 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-03-13 21:59:04,150 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 240 flow [2025-03-13 21:59:04,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-13 21:59:04,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:04,151 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:59:04,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:59:04,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:59:04,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1800088938, now seen corresponding path program 1 times [2025-03-13 21:59:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708196006] [2025-03-13 21:59:04,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:04,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 21:59:04,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 21:59:04,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:04,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708196006] [2025-03-13 21:59:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708196006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624851563] [2025-03-13 21:59:04,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:04,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:04,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:04,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:04,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:59:04,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 21:59:04,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 21:59:04,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:04,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:04,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:04,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:04,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:04,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624851563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:04,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:04,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:04,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927811580] [2025-03-13 21:59:04,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:04,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:04,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:04,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:04,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-03-13 21:59:04,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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-13 21:59:04,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:04,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-03-13 21:59:04,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:04,562 INFO L124 PetriNetUnfolderBase]: 5/142 cut-off events. [2025-03-13 21:59:04,562 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:59:04,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 142 events. 5/142 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2025-03-13 21:59:04,563 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 11 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-03-13 21:59:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 121 transitions, 298 flow [2025-03-13 21:59:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 967 transitions. [2025-03-13 21:59:04,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8806921675774135 [2025-03-13 21:59:04,566 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 240 flow. Second operand 9 states and 967 transitions. [2025-03-13 21:59:04,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 121 transitions, 298 flow [2025-03-13 21:59:04,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:04,568 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 288 flow [2025-03-13 21:59:04,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2025-03-13 21:59:04,569 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-13 21:59:04,569 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 288 flow [2025-03-13 21:59:04,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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-13 21:59:04,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:04,570 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-13 21:59:04,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:59:04,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:04,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:59:04,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1402008106, now seen corresponding path program 2 times [2025-03-13 21:59:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033243144] [2025-03-13 21:59:04,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:04,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-13 21:59:04,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 21:59:04,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:04,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033243144] [2025-03-13 21:59:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033243144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200244171] [2025-03-13 21:59:04,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:04,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:04,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:59:05,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-13 21:59:05,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 21:59:05,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:05,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:05,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:05,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:05,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200244171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:05,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045385424] [2025-03-13 21:59:05,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:05,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:05,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:05,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-03-13 21:59:05,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 288 flow. Second operand has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 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-13 21:59:05,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:05,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-03-13 21:59:05,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:05,531 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-03-13 21:59:05,533 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:59:05,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 181 events. 5/181 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-03-13 21:59:05,534 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 14 selfloop transitions, 18 changer transitions 0/133 dead transitions. [2025-03-13 21:59:05,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 426 flow [2025-03-13 21:59:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1925 transitions. [2025-03-13 21:59:05,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765938069216758 [2025-03-13 21:59:05,539 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 288 flow. Second operand 18 states and 1925 transitions. [2025-03-13 21:59:05,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 426 flow [2025-03-13 21:59:05,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:05,542 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 388 flow [2025-03-13 21:59:05,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=388, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2025-03-13 21:59:05,543 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-03-13 21:59:05,543 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 388 flow [2025-03-13 21:59:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 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-13 21:59:05,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:05,544 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-13 21:59:05,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:59:05,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-13 21:59:05,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:59:05,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1148885416, now seen corresponding path program 3 times [2025-03-13 21:59:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843234123] [2025-03-13 21:59:05,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:05,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-03-13 21:59:05,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 21:59:05,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-13 21:59:05,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:05,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:05,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 21:59:05,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 21:59:05,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:05,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:05,865 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:05,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 21:59:05,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 21:59:05,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 21:59:05,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 21:59:05,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 21:59:05,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 21:59:05,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 21:59:05,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 21:59:05,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 21:59:05,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 21:59:05,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:59:05,869 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:59:05,873 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:05,873 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:59:05,905 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:05,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 192 transitions, 394 flow [2025-03-13 21:59:05,948 INFO L124 PetriNetUnfolderBase]: 15/208 cut-off events. [2025-03-13 21:59:05,948 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:59:05,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 208 events. 15/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 526 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 147. Up to 3 conditions per place. [2025-03-13 21:59:05,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 192 transitions, 394 flow [2025-03-13 21:59:05,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 192 transitions, 394 flow [2025-03-13 21:59:05,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:05,953 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;@3012563f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:05,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-13 21:59:05,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:05,957 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:05,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:05,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:05,957 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] [2025-03-13 21:59:05,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 21:59:05,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1557277306, now seen corresponding path program 1 times [2025-03-13 21:59:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014798229] [2025-03-13 21:59:05,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:05,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:05,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:05,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:06,134 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-13 21:59:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014798229] [2025-03-13 21:59:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014798229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110115362] [2025-03-13 21:59:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:06,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:06,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:06,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:06,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 192 [2025-03-13 21:59:06,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 192 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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-13 21:59:06,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:06,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 192 [2025-03-13 21:59:06,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:06,341 INFO L124 PetriNetUnfolderBase]: 90/600 cut-off events. [2025-03-13 21:59:06,342 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 21:59:06,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 600 events. 90/600 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3394 event pairs, 42 based on Foata normal form. 91/595 useless extension candidates. Maximal degree in co-relation 312. Up to 125 conditions per place. [2025-03-13 21:59:06,347 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 20 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-03-13 21:59:06,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 414 flow [2025-03-13 21:59:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions. [2025-03-13 21:59:06,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2025-03-13 21:59:06,350 INFO L175 Difference]: Start difference. First operand has 182 places, 192 transitions, 394 flow. Second operand 6 states and 969 transitions. [2025-03-13 21:59:06,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 177 transitions, 414 flow [2025-03-13 21:59:06,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 177 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:06,353 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 374 flow [2025-03-13 21:59:06,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2025-03-13 21:59:06,353 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-03-13 21:59:06,354 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 374 flow [2025-03-13 21:59:06,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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-13 21:59:06,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:06,354 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:59:06,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 21:59:06,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1159655658, now seen corresponding path program 1 times [2025-03-13 21:59:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526583742] [2025-03-13 21:59:06,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:06,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:59:06,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:59:06,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:06,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:06,379 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-13 21:59:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:06,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526583742] [2025-03-13 21:59:06,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526583742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:06,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:06,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551621023] [2025-03-13 21:59:06,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:06,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:06,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:06,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:06,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2025-03-13 21:59:06,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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-13 21:59:06,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:06,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2025-03-13 21:59:06,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:06,432 INFO L124 PetriNetUnfolderBase]: 23/345 cut-off events. [2025-03-13 21:59:06,432 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-13 21:59:06,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 345 events. 23/345 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1168 event pairs, 6 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 332. Up to 24 conditions per place. [2025-03-13 21:59:06,435 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 10 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-03-13 21:59:06,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 402 flow [2025-03-13 21:59:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-03-13 21:59:06,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2025-03-13 21:59:06,436 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 374 flow. Second operand 3 states and 526 transitions. [2025-03-13 21:59:06,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 402 flow [2025-03-13 21:59:06,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:06,439 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 376 flow [2025-03-13 21:59:06,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2025-03-13 21:59:06,439 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-03-13 21:59:06,440 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 376 flow [2025-03-13 21:59:06,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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-13 21:59:06,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:06,440 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-03-13 21:59:06,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:59:06,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 21:59:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2058549844, now seen corresponding path program 1 times [2025-03-13 21:59:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106908276] [2025-03-13 21:59:06,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:06,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:06,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 21:59:06,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 21:59:06,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:06,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:06,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106908276] [2025-03-13 21:59:06,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106908276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:06,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074951077] [2025-03-13 21:59:06,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:06,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:06,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:06,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:06,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:59:06,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 21:59:06,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 21:59:06,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:06,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:06,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:06,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:06,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074951077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:06,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026300650] [2025-03-13 21:59:06,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:06,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:06,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:06,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-03-13 21:59:06,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 376 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-13 21:59:06,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:06,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-03-13 21:59:06,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:06,787 INFO L124 PetriNetUnfolderBase]: 23/360 cut-off events. [2025-03-13 21:59:06,788 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 21:59:06,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 360 events. 23/360 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1137 event pairs, 6 based on Foata normal form. 2/321 useless extension candidates. Maximal degree in co-relation 367. Up to 24 conditions per place. [2025-03-13 21:59:06,790 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 14 selfloop transitions, 9 changer transitions 0/186 dead transitions. [2025-03-13 21:59:06,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 186 transitions, 440 flow [2025-03-13 21:59:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1537 transitions. [2025-03-13 21:59:06,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894675925925926 [2025-03-13 21:59:06,794 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 376 flow. Second operand 9 states and 1537 transitions. [2025-03-13 21:59:06,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 186 transitions, 440 flow [2025-03-13 21:59:06,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:06,797 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 424 flow [2025-03-13 21:59:06,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=424, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-03-13 21:59:06,799 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-03-13 21:59:06,799 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 424 flow [2025-03-13 21:59:06,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-13 21:59:06,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:06,800 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:06,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:59:07,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:07,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 21:59:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash 85852780, now seen corresponding path program 2 times [2025-03-13 21:59:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858796374] [2025-03-13 21:59:07,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:07,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-13 21:59:07,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 21:59:07,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:07,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858796374] [2025-03-13 21:59:07,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858796374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764897355] [2025-03-13 21:59:07,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:07,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:07,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:07,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:59:07,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-13 21:59:07,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 21:59:07,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:07,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:07,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:07,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:07,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764897355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:07,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544460101] [2025-03-13 21:59:07,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:07,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:07,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:07,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-03-13 21:59:07,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 424 flow. Second operand has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 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-13 21:59:07,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:07,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-03-13 21:59:07,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:07,617 INFO L124 PetriNetUnfolderBase]: 23/399 cut-off events. [2025-03-13 21:59:07,618 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-13 21:59:07,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 399 events. 23/399 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1139 event pairs, 6 based on Foata normal form. 3/361 useless extension candidates. Maximal degree in co-relation 329. Up to 24 conditions per place. [2025-03-13 21:59:07,620 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 17 selfloop transitions, 18 changer transitions 0/198 dead transitions. [2025-03-13 21:59:07,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 568 flow [2025-03-13 21:59:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3062 transitions. [2025-03-13 21:59:07,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859953703703703 [2025-03-13 21:59:07,625 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 424 flow. Second operand 18 states and 3062 transitions. [2025-03-13 21:59:07,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 568 flow [2025-03-13 21:59:07,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:07,628 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 524 flow [2025-03-13 21:59:07,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=524, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2025-03-13 21:59:07,628 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-03-13 21:59:07,629 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 524 flow [2025-03-13 21:59:07,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 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-13 21:59:07,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:07,630 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:07,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:59:07,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:07,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 21:59:07,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1905122646, now seen corresponding path program 3 times [2025-03-13 21:59:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:07,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694267601] [2025-03-13 21:59:07,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:07,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-13 21:59:07,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 21:59:07,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:59:07,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:07,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:07,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 21:59:07,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 21:59:07,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:07,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:07,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:07,935 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-13 21:59:07,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-13 21:59:07,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-13 21:59:07,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-13 21:59:07,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-13 21:59:07,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-13 21:59:07,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:59:07,937 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:59:07,937 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:07,937 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:59:07,961 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:07,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 262 transitions, 542 flow [2025-03-13 21:59:07,985 INFO L124 PetriNetUnfolderBase]: 22/287 cut-off events. [2025-03-13 21:59:07,986 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:59:07,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 22/287 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 916 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 216. Up to 4 conditions per place. [2025-03-13 21:59:07,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 262 transitions, 542 flow [2025-03-13 21:59:07,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 262 transitions, 542 flow [2025-03-13 21:59:07,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:07,991 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;@3012563f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:07,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-13 21:59:07,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:07,993 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:07,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:07,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:07,993 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] [2025-03-13 21:59:07,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 21:59:07,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 264705728, now seen corresponding path program 1 times [2025-03-13 21:59:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:07,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829959656] [2025-03-13 21:59:07,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:07,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:08,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:08,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:08,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:08,144 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-13 21:59:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829959656] [2025-03-13 21:59:08,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829959656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:08,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:08,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:08,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958930662] [2025-03-13 21:59:08,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:08,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:08,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:08,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:08,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 262 [2025-03-13 21:59:08,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 262 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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-13 21:59:08,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:08,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 262 [2025-03-13 21:59:08,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:08,725 INFO L124 PetriNetUnfolderBase]: 1081/4122 cut-off events. [2025-03-13 21:59:08,725 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-13 21:59:08,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 4122 events. 1081/4122 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 38989 event pairs, 630 based on Foata normal form. 720/4055 useless extension candidates. Maximal degree in co-relation 1470. Up to 1318 conditions per place. [2025-03-13 21:59:08,762 INFO L140 encePairwiseOnDemand]: 246/262 looper letters, 27 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-03-13 21:59:08,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 242 transitions, 566 flow [2025-03-13 21:59:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2025-03-13 21:59:08,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479643765903307 [2025-03-13 21:59:08,795 INFO L175 Difference]: Start difference. First operand has 247 places, 262 transitions, 542 flow. Second operand 6 states and 1333 transitions. [2025-03-13 21:59:08,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 242 transitions, 566 flow [2025-03-13 21:59:08,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 242 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:08,800 INFO L231 Difference]: Finished difference. Result has 241 places, 242 transitions, 510 flow [2025-03-13 21:59:08,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=241, PETRI_TRANSITIONS=242} [2025-03-13 21:59:08,801 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-03-13 21:59:08,801 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 242 transitions, 510 flow [2025-03-13 21:59:08,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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-13 21:59:08,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:08,801 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:08,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:59:08,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 21:59:08,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -481126473, now seen corresponding path program 1 times [2025-03-13 21:59:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878540740] [2025-03-13 21:59:08,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:08,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 21:59:08,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 21:59:08,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:08,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:08,830 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-13 21:59:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878540740] [2025-03-13 21:59:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878540740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92579710] [2025-03-13 21:59:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:08,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:08,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:08,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:08,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 262 [2025-03-13 21:59:08,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 242 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-13 21:59:08,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:08,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 262 [2025-03-13 21:59:08,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:08,937 INFO L124 PetriNetUnfolderBase]: 95/1017 cut-off events. [2025-03-13 21:59:08,938 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-13 21:59:08,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 1017 events. 95/1017 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6163 event pairs, 42 based on Foata normal form. 1/883 useless extension candidates. Maximal degree in co-relation 1094. Up to 87 conditions per place. [2025-03-13 21:59:08,952 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 13 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-03-13 21:59:08,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 243 transitions, 544 flow [2025-03-13 21:59:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-13 21:59:08,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134860050890585 [2025-03-13 21:59:08,954 INFO L175 Difference]: Start difference. First operand has 241 places, 242 transitions, 510 flow. Second operand 3 states and 718 transitions. [2025-03-13 21:59:08,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 243 transitions, 544 flow [2025-03-13 21:59:08,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 243 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:08,957 INFO L231 Difference]: Finished difference. Result has 239 places, 243 transitions, 512 flow [2025-03-13 21:59:08,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=239, PETRI_TRANSITIONS=243} [2025-03-13 21:59:08,959 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-03-13 21:59:08,959 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 243 transitions, 512 flow [2025-03-13 21:59:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-13 21:59:08,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:08,960 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:59:08,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 21:59:08,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2005451263, now seen corresponding path program 1 times [2025-03-13 21:59:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:08,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772217351] [2025-03-13 21:59:08,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:08,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 21:59:08,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 21:59:08,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:08,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772217351] [2025-03-13 21:59:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772217351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338677723] [2025-03-13 21:59:09,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:09,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:09,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:09,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:09,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:59:09,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 21:59:09,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 21:59:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:09,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:09,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:09,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338677723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:09,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:09,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303326031] [2025-03-13 21:59:09,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:09,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:09,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:09,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:09,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-03-13 21:59:09,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 243 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 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-13 21:59:09,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:09,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-03-13 21:59:09,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:09,346 INFO L124 PetriNetUnfolderBase]: 95/1032 cut-off events. [2025-03-13 21:59:09,346 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-13 21:59:09,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1032 events. 95/1032 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6134 event pairs, 42 based on Foata normal form. 2/899 useless extension candidates. Maximal degree in co-relation 1129. Up to 87 conditions per place. [2025-03-13 21:59:09,355 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 17 selfloop transitions, 9 changer transitions 0/251 dead transitions. [2025-03-13 21:59:09,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 251 transitions, 582 flow [2025-03-13 21:59:09,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2107 transitions. [2025-03-13 21:59:09,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8935538592027141 [2025-03-13 21:59:09,358 INFO L175 Difference]: Start difference. First operand has 239 places, 243 transitions, 512 flow. Second operand 9 states and 2107 transitions. [2025-03-13 21:59:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 251 transitions, 582 flow [2025-03-13 21:59:09,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:09,361 INFO L231 Difference]: Finished difference. Result has 249 places, 249 transitions, 560 flow [2025-03-13 21:59:09,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=249, PETRI_TRANSITIONS=249} [2025-03-13 21:59:09,362 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-03-13 21:59:09,362 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 249 transitions, 560 flow [2025-03-13 21:59:09,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 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-13 21:59:09,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:09,363 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:09,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:59:09,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 21:59:09,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 21:59:09,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1556737279, now seen corresponding path program 2 times [2025-03-13 21:59:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:09,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198656409] [2025-03-13 21:59:09,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:09,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-13 21:59:09,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 21:59:09,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:09,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198656409] [2025-03-13 21:59:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198656409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948355362] [2025-03-13 21:59:09,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:09,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:09,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:09,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:59:09,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-13 21:59:09,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 21:59:09,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:09,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:09,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:09,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:09,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948355362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:09,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391968944] [2025-03-13 21:59:09,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:09,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-03-13 21:59:09,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 249 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 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-13 21:59:09,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:09,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-03-13 21:59:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:10,240 INFO L124 PetriNetUnfolderBase]: 95/1071 cut-off events. [2025-03-13 21:59:10,240 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-13 21:59:10,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1071 events. 95/1071 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6167 event pairs, 42 based on Foata normal form. 3/939 useless extension candidates. Maximal degree in co-relation 1091. Up to 87 conditions per place. [2025-03-13 21:59:10,249 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 20 selfloop transitions, 18 changer transitions 0/263 dead transitions. [2025-03-13 21:59:10,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 710 flow [2025-03-13 21:59:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4199 transitions. [2025-03-13 21:59:10,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890373197625106 [2025-03-13 21:59:10,257 INFO L175 Difference]: Start difference. First operand has 249 places, 249 transitions, 560 flow. Second operand 18 states and 4199 transitions. [2025-03-13 21:59:10,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 710 flow [2025-03-13 21:59:10,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 263 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:10,261 INFO L231 Difference]: Finished difference. Result has 269 places, 259 transitions, 660 flow [2025-03-13 21:59:10,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=660, PETRI_PLACES=269, PETRI_TRANSITIONS=259} [2025-03-13 21:59:10,261 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-03-13 21:59:10,261 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 259 transitions, 660 flow [2025-03-13 21:59:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 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-13 21:59:10,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:10,263 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:10,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 21:59:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:10,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-13 21:59:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 752400055, now seen corresponding path program 3 times [2025-03-13 21:59:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29292346] [2025-03-13 21:59:10,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:10,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-13 21:59:10,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 21:59:10,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-13 21:59:10,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:10,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:10,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-13 21:59:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 21:59:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:10,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:10,544 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:10,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-13 21:59:10,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-13 21:59:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-13 21:59:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-13 21:59:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-13 21:59:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-13 21:59:10,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:59:10,546 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:59:10,547 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:10,547 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:59:10,583 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:10,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 332 transitions, 692 flow [2025-03-13 21:59:10,626 INFO L124 PetriNetUnfolderBase]: 29/366 cut-off events. [2025-03-13 21:59:10,627 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:59:10,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 366 events. 29/366 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1328 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 295. Up to 5 conditions per place. [2025-03-13 21:59:10,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 332 transitions, 692 flow [2025-03-13 21:59:10,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 332 transitions, 692 flow [2025-03-13 21:59:10,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:10,637 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;@3012563f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:10,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-13 21:59:10,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:10,639 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:10,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:10,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:10,639 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] [2025-03-13 21:59:10,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:59:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 659523212, now seen corresponding path program 1 times [2025-03-13 21:59:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355854577] [2025-03-13 21:59:10,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:10,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:10,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:10,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:10,774 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-13 21:59:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:10,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355854577] [2025-03-13 21:59:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355854577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:10,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627564374] [2025-03-13 21:59:10,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:10,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:10,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:10,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:10,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 332 [2025-03-13 21:59:10,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 332 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 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-13 21:59:10,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:10,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 332 [2025-03-13 21:59:10,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:14,014 INFO L124 PetriNetUnfolderBase]: 10778/30460 cut-off events. [2025-03-13 21:59:14,014 INFO L125 PetriNetUnfolderBase]: For 4130/4130 co-relation queries the response was YES. [2025-03-13 21:59:14,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44913 conditions, 30460 events. 10778/30460 cut-off events. For 4130/4130 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 371221 event pairs, 6804 based on Foata normal form. 6397/30591 useless extension candidates. Maximal degree in co-relation 6942. Up to 12509 conditions per place. [2025-03-13 21:59:14,305 INFO L140 encePairwiseOnDemand]: 313/332 looper letters, 34 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2025-03-13 21:59:14,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 720 flow [2025-03-13 21:59:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1697 transitions. [2025-03-13 21:59:14,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8519076305220884 [2025-03-13 21:59:14,312 INFO L175 Difference]: Start difference. First operand has 312 places, 332 transitions, 692 flow. Second operand 6 states and 1697 transitions. [2025-03-13 21:59:14,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 720 flow [2025-03-13 21:59:14,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:14,318 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 646 flow [2025-03-13 21:59:14,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-03-13 21:59:14,320 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-13 21:59:14,320 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 646 flow [2025-03-13 21:59:14,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 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-13 21:59:14,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:14,320 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] [2025-03-13 21:59:14,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:59:14,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:59:14,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2020750175, now seen corresponding path program 1 times [2025-03-13 21:59:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16886233] [2025-03-13 21:59:14,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:14,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 21:59:14,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 21:59:14,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:14,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:14,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16886233] [2025-03-13 21:59:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16886233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:14,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:14,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134211934] [2025-03-13 21:59:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:14,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:14,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:14,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:14,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-03-13 21:59:14,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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-13 21:59:14,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:14,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-03-13 21:59:14,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:14,879 INFO L124 PetriNetUnfolderBase]: 365/3087 cut-off events. [2025-03-13 21:59:14,879 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-13 21:59:14,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 3087 events. 365/3087 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26986 event pairs, 204 based on Foata normal form. 1/2670 useless extension candidates. Maximal degree in co-relation 3488. Up to 330 conditions per place. [2025-03-13 21:59:14,932 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-13 21:59:14,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 308 transitions, 686 flow [2025-03-13 21:59:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-03-13 21:59:14,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9136546184738956 [2025-03-13 21:59:14,943 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 646 flow. Second operand 3 states and 910 transitions. [2025-03-13 21:59:14,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 308 transitions, 686 flow [2025-03-13 21:59:14,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 308 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:14,953 INFO L231 Difference]: Finished difference. Result has 302 places, 308 transitions, 648 flow [2025-03-13 21:59:14,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=302, PETRI_TRANSITIONS=308} [2025-03-13 21:59:14,954 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-13 21:59:14,954 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 308 transitions, 648 flow [2025-03-13 21:59:14,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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-13 21:59:14,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:14,958 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] [2025-03-13 21:59:14,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:59:14,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:59:14,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash 319988109, now seen corresponding path program 1 times [2025-03-13 21:59:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:14,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25819817] [2025-03-13 21:59:14,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:14,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:59:14,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:59:14,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:14,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25819817] [2025-03-13 21:59:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25819817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836426315] [2025-03-13 21:59:15,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:15,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:15,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:15,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:15,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:59:15,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:59:15,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:59:15,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:15,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:15,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 21:59:15,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:59:15,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:59:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836426315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:15,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:59:15,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-13 21:59:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716244712] [2025-03-13 21:59:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:15,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:15,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:15,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:15,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 332 [2025-03-13 21:59:15,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 308 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-13 21:59:15,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:15,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 332 [2025-03-13 21:59:15,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:16,183 INFO L124 PetriNetUnfolderBase]: 1136/6735 cut-off events. [2025-03-13 21:59:16,183 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-13 21:59:16,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 6735 events. 1136/6735 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 70769 event pairs, 690 based on Foata normal form. 40/5788 useless extension candidates. Maximal degree in co-relation 8303. Up to 1091 conditions per place. [2025-03-13 21:59:16,275 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-13 21:59:16,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 318 transitions, 741 flow [2025-03-13 21:59:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-03-13 21:59:16,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9216867469879518 [2025-03-13 21:59:16,277 INFO L175 Difference]: Start difference. First operand has 302 places, 308 transitions, 648 flow. Second operand 3 states and 918 transitions. [2025-03-13 21:59:16,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 318 transitions, 741 flow [2025-03-13 21:59:16,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 318 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:16,282 INFO L231 Difference]: Finished difference. Result has 304 places, 309 transitions, 658 flow [2025-03-13 21:59:16,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=304, PETRI_TRANSITIONS=309} [2025-03-13 21:59:16,283 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-13 21:59:16,283 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 309 transitions, 658 flow [2025-03-13 21:59:16,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-13 21:59:16,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:16,284 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:16,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:59:16,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:16,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:59:16,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2076401757, now seen corresponding path program 1 times [2025-03-13 21:59:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:16,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096992797] [2025-03-13 21:59:16,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:16,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:59:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:59:16,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:16,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096992797] [2025-03-13 21:59:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096992797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21237375] [2025-03-13 21:59:16,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:16,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:16,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:16,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:16,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:59:16,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:59:16,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:59:16,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:16,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:16,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:16,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:16,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21237375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:16,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:16,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:16,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861097211] [2025-03-13 21:59:16,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:16,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:16,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:16,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:16,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-03-13 21:59:16,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 309 transitions, 658 flow. Second operand has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 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-13 21:59:16,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:16,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-03-13 21:59:16,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:17,075 INFO L124 PetriNetUnfolderBase]: 366/3121 cut-off events. [2025-03-13 21:59:17,076 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-13 21:59:17,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 3121 events. 366/3121 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26782 event pairs, 204 based on Foata normal form. 2/2699 useless extension candidates. Maximal degree in co-relation 3504. Up to 330 conditions per place. [2025-03-13 21:59:17,112 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 20 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2025-03-13 21:59:17,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 317 transitions, 734 flow [2025-03-13 21:59:17,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2677 transitions. [2025-03-13 21:59:17,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959170013386881 [2025-03-13 21:59:17,114 INFO L175 Difference]: Start difference. First operand has 304 places, 309 transitions, 658 flow. Second operand 9 states and 2677 transitions. [2025-03-13 21:59:17,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 317 transitions, 734 flow [2025-03-13 21:59:17,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 317 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:17,118 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 706 flow [2025-03-13 21:59:17,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2025-03-13 21:59:17,118 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 2 predicate places. [2025-03-13 21:59:17,118 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 706 flow [2025-03-13 21:59:17,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 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-13 21:59:17,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:17,119 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:17,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-13 21:59:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:17,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:59:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1613897949, now seen corresponding path program 2 times [2025-03-13 21:59:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502931632] [2025-03-13 21:59:17,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:17,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 21:59:17,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 21:59:17,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:17,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:17,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502931632] [2025-03-13 21:59:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502931632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520591031] [2025-03-13 21:59:17,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:17,424 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:17,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:59:17,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 21:59:17,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 21:59:17,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:17,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:17,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:17,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:17,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520591031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:17,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050905723] [2025-03-13 21:59:17,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:17,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:17,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:17,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:17,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-03-13 21:59:17,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 706 flow. Second operand has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 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-13 21:59:17,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:17,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-03-13 21:59:17,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:18,225 INFO L124 PetriNetUnfolderBase]: 366/3160 cut-off events. [2025-03-13 21:59:18,225 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-13 21:59:18,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3693 conditions, 3160 events. 366/3160 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26710 event pairs, 204 based on Foata normal form. 3/2739 useless extension candidates. Maximal degree in co-relation 3508. Up to 330 conditions per place. [2025-03-13 21:59:18,270 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 23 selfloop transitions, 18 changer transitions 0/329 dead transitions. [2025-03-13 21:59:18,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 862 flow [2025-03-13 21:59:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5336 transitions. [2025-03-13 21:59:18,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892904953145917 [2025-03-13 21:59:18,274 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 706 flow. Second operand 18 states and 5336 transitions. [2025-03-13 21:59:18,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 862 flow [2025-03-13 21:59:18,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 850 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:18,278 INFO L231 Difference]: Finished difference. Result has 334 places, 325 transitions, 806 flow [2025-03-13 21:59:18,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=334, PETRI_TRANSITIONS=325} [2025-03-13 21:59:18,279 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 22 predicate places. [2025-03-13 21:59:18,279 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 325 transitions, 806 flow [2025-03-13 21:59:18,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 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-13 21:59:18,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:18,281 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:18,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-13 21:59:18,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:18,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:59:18,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2133108879, now seen corresponding path program 3 times [2025-03-13 21:59:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364060907] [2025-03-13 21:59:18,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:18,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 7 equivalence classes. [2025-03-13 21:59:18,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 21:59:18,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-13 21:59:18,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:18,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:18,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-13 21:59:18,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 21:59:18,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:18,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:18,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:18,543 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:18,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-13 21:59:18,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-13 21:59:18,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-13 21:59:18,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-13 21:59:18,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-13 21:59:18,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-13 21:59:18,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-13 21:59:18,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-13 21:59:18,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 21:59:18,545 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-13 21:59:18,545 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:18,545 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 21:59:18,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:18,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 402 transitions, 844 flow [2025-03-13 21:59:18,623 INFO L124 PetriNetUnfolderBase]: 36/445 cut-off events. [2025-03-13 21:59:18,623 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:59:18,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 445 events. 36/445 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1784 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 379. Up to 6 conditions per place. [2025-03-13 21:59:18,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 402 transitions, 844 flow [2025-03-13 21:59:18,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 402 transitions, 844 flow [2025-03-13 21:59:18,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:18,633 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;@3012563f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:18,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-13 21:59:18,634 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:18,634 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:18,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:18,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:18,635 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] [2025-03-13 21:59:18,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:18,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1553237538, now seen corresponding path program 1 times [2025-03-13 21:59:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:18,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487254324] [2025-03-13 21:59:18,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:18,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:18,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:18,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:18,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:18,749 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-13 21:59:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:18,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487254324] [2025-03-13 21:59:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487254324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523139207] [2025-03-13 21:59:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:18,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:18,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:18,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:18,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 402 [2025-03-13 21:59:18,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 402 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 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-13 21:59:18,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:18,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 402 [2025-03-13 21:59:18,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:48,015 INFO L124 PetriNetUnfolderBase]: 98025/234114 cut-off events. [2025-03-13 21:59:48,015 INFO L125 PetriNetUnfolderBase]: For 43281/43281 co-relation queries the response was YES. [2025-03-13 21:59:50,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360711 conditions, 234114 events. 98025/234114 cut-off events. For 43281/43281 co-relation queries the response was YES. Maximal size of possible extension queue 9651. Compared 3370967 event pairs, 64428 based on Foata normal form. 43303/227901 useless extension candidates. Maximal degree in co-relation 45257. Up to 110246 conditions per place. [2025-03-13 21:59:52,227 INFO L140 encePairwiseOnDemand]: 380/402 looper letters, 41 selfloop transitions, 5 changer transitions 0/372 dead transitions. [2025-03-13 21:59:52,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 372 transitions, 876 flow [2025-03-13 21:59:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2061 transitions. [2025-03-13 21:59:52,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544776119402985 [2025-03-13 21:59:52,229 INFO L175 Difference]: Start difference. First operand has 377 places, 402 transitions, 844 flow. Second operand 6 states and 2061 transitions. [2025-03-13 21:59:52,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 372 transitions, 876 flow [2025-03-13 21:59:52,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 372 transitions, 864 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:52,243 INFO L231 Difference]: Finished difference. Result has 367 places, 372 transitions, 782 flow [2025-03-13 21:59:52,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2025-03-13 21:59:52,244 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -10 predicate places. [2025-03-13 21:59:52,244 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 782 flow [2025-03-13 21:59:52,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 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-13 21:59:52,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:52,244 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] [2025-03-13 21:59:52,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 21:59:52,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:52,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1063619031, now seen corresponding path program 1 times [2025-03-13 21:59:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424707353] [2025-03-13 21:59:52,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:52,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 21:59:52,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 21:59:52,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:52,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:52,268 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-13 21:59:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:52,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424707353] [2025-03-13 21:59:52,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424707353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:52,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:52,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883200748] [2025-03-13 21:59:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:52,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:52,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:52,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:52,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 402 [2025-03-13 21:59:52,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-13 21:59:52,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:52,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 402 [2025-03-13 21:59:52,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:53,558 INFO L124 PetriNetUnfolderBase]: 1337/9459 cut-off events. [2025-03-13 21:59:53,558 INFO L125 PetriNetUnfolderBase]: For 1173/1173 co-relation queries the response was YES. [2025-03-13 21:59:53,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11060 conditions, 9459 events. 1337/9459 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 106326 event pairs, 852 based on Foata normal form. 1/8193 useless extension candidates. Maximal degree in co-relation 10994. Up to 1221 conditions per place. [2025-03-13 21:59:53,689 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 19 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-03-13 21:59:53,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 828 flow [2025-03-13 21:59:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-03-13 21:59:53,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137645107794361 [2025-03-13 21:59:53,690 INFO L175 Difference]: Start difference. First operand has 367 places, 372 transitions, 782 flow. Second operand 3 states and 1102 transitions. [2025-03-13 21:59:53,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 828 flow [2025-03-13 21:59:53,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 373 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:53,695 INFO L231 Difference]: Finished difference. Result has 365 places, 373 transitions, 784 flow [2025-03-13 21:59:53,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=365, PETRI_TRANSITIONS=373} [2025-03-13 21:59:53,696 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -12 predicate places. [2025-03-13 21:59:53,696 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 373 transitions, 784 flow [2025-03-13 21:59:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-13 21:59:53,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:53,697 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] [2025-03-13 21:59:53,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 21:59:53,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:53,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1139976899, now seen corresponding path program 1 times [2025-03-13 21:59:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:53,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639164552] [2025-03-13 21:59:53,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:53,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:59:53,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:59:53,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:53,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639164552] [2025-03-13 21:59:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639164552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061941147] [2025-03-13 21:59:53,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:53,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:53,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:53,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:53,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-13 21:59:53,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:59:53,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:59:53,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:53,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:53,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 21:59:53,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:59:53,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:59:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061941147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:53,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:59:53,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-13 21:59:53,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879583528] [2025-03-13 21:59:53,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:53,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:53,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:53,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:53,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 402 [2025-03-13 21:59:53,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 373 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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-13 21:59:53,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:53,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 402 [2025-03-13 21:59:53,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:56,795 INFO L124 PetriNetUnfolderBase]: 4346/23625 cut-off events. [2025-03-13 21:59:56,795 INFO L125 PetriNetUnfolderBase]: For 2702/2702 co-relation queries the response was YES. [2025-03-13 21:59:57,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29292 conditions, 23625 events. 4346/23625 cut-off events. For 2702/2702 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 310121 event pairs, 2796 based on Foata normal form. 121/20356 useless extension candidates. Maximal degree in co-relation 29243. Up to 4007 conditions per place. [2025-03-13 21:59:57,375 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 33 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-03-13 21:59:57,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 386 transitions, 900 flow [2025-03-13 21:59:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2025-03-13 21:59:57,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2025-03-13 21:59:57,377 INFO L175 Difference]: Start difference. First operand has 365 places, 373 transitions, 784 flow. Second operand 3 states and 1113 transitions. [2025-03-13 21:59:57,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 386 transitions, 900 flow [2025-03-13 21:59:57,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:57,392 INFO L231 Difference]: Finished difference. Result has 367 places, 374 transitions, 794 flow [2025-03-13 21:59:57,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=367, PETRI_TRANSITIONS=374} [2025-03-13 21:59:57,392 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -10 predicate places. [2025-03-13 21:59:57,392 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 374 transitions, 794 flow [2025-03-13 21:59:57,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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-13 21:59:57,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:57,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:59:57,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-13 21:59:57,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-13 21:59:57,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:57,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash -615899355, now seen corresponding path program 1 times [2025-03-13 21:59:57,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:57,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776973439] [2025-03-13 21:59:57,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:57,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 21:59:57,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 21:59:57,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:57,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776973439] [2025-03-13 21:59:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776973439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395236712] [2025-03-13 21:59:57,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:57,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:57,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:57,645 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-13 21:59:57,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 21:59:57,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 21:59:57,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:57,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:57,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:57,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:57,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:57,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395236712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:57,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:57,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735629217] [2025-03-13 21:59:57,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:57,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:57,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:57,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 402 [2025-03-13 21:59:57,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 374 transitions, 794 flow. Second operand has 10 states, 10 states have (on average 358.9) internal successors, (3589), 10 states have internal predecessors, (3589), 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-13 21:59:57,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:57,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 402 [2025-03-13 21:59:57,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:59,364 INFO L124 PetriNetUnfolderBase]: 1338/9493 cut-off events. [2025-03-13 21:59:59,364 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-03-13 21:59:59,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11107 conditions, 9493 events. 1338/9493 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 106340 event pairs, 852 based on Foata normal form. 2/8221 useless extension candidates. Maximal degree in co-relation 11010. Up to 1221 conditions per place. [2025-03-13 21:59:59,566 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 23 selfloop transitions, 9 changer transitions 0/382 dead transitions. [2025-03-13 21:59:59,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 382 transitions, 876 flow [2025-03-13 21:59:59,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3247 transitions. [2025-03-13 21:59:59,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974571586511885 [2025-03-13 21:59:59,568 INFO L175 Difference]: Start difference. First operand has 367 places, 374 transitions, 794 flow. Second operand 9 states and 3247 transitions. [2025-03-13 21:59:59,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 382 transitions, 876 flow [2025-03-13 21:59:59,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 382 transitions, 874 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:59,575 INFO L231 Difference]: Finished difference. Result has 377 places, 380 transitions, 842 flow [2025-03-13 21:59:59,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=842, PETRI_PLACES=377, PETRI_TRANSITIONS=380} [2025-03-13 21:59:59,575 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, 0 predicate places. [2025-03-13 21:59:59,575 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 380 transitions, 842 flow [2025-03-13 21:59:59,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 358.9) internal successors, (3589), 10 states have internal predecessors, (3589), 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-13 21:59:59,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:59,576 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:59:59,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-13 21:59:59,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-13 21:59:59,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:59,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash 865373413, now seen corresponding path program 2 times [2025-03-13 21:59:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170435064] [2025-03-13 21:59:59,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:59,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-13 21:59:59,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 96 statements. [2025-03-13 21:59:59,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:59:59,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-13 21:59:59,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:59,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170435064] [2025-03-13 21:59:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170435064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:59,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:59,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809675946] [2025-03-13 21:59:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:59,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:59,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:59,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:00:00,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 402 [2025-03-13 22:00:00,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 380 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 352.3333333333333) internal successors, (2114), 6 states have internal predecessors, (2114), 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-13 22:00:00,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:00,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 402 [2025-03-13 22:00:00,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand