./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/goblint-regression/06-symbeq_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:04:22,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:04:22,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:04:22,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:04:22,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:04:22,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:04:22,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:04:22,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:04:22,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:04:22,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:04:22,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:04:22,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:04:22,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:04:22,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:04:22,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:04:22,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:04:22,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:04:22,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:04:22,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:04:22,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:04:22,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:22,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:04:22,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:04:22,488 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2025-03-17 11:04:22,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:04:22,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:04:22,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:04:22,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:04:22,714 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:04:22,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-17 11:04:23,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d7b8326/f1eb4698093a447bb72044807770d225/FLAG464d9e7fa [2025-03-17 11:04:24,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:04:24,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-17 11:04:24,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d7b8326/f1eb4698093a447bb72044807770d225/FLAG464d9e7fa [2025-03-17 11:04:24,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d7b8326/f1eb4698093a447bb72044807770d225 [2025-03-17 11:04:24,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:04:24,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:04:24,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:24,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:04:24,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:04:24,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa72034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24, skipping insertion in model container [2025-03-17 11:04:24,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:04:24,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:24,451 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:04:24,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:24,528 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:04:24,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24 WrapperNode [2025-03-17 11:04:24,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:24,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:24,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:04:24,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:04:24,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,566 INFO L138 Inliner]: procedures = 263, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2025-03-17 11:04:24,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:24,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:04:24,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:04:24,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:04:24,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:04:24,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:04:24,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:04:24,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:04:24,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (1/1) ... [2025-03-17 11:04:24,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:24,612 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-17 11:04:24,614 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-17 11:04:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:04:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:04:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:04:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:04:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:04:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:04:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:04:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:04:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:04:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:04:24,629 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:04:24,712 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:04:24,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:04:24,918 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:04:24,918 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:04:24,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:04:24,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:04:24,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:24 BoogieIcfgContainer [2025-03-17 11:04:24,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:04:24,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:04:24,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:04:24,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:04:24,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:04:24" (1/3) ... [2025-03-17 11:04:24,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211547f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:24, skipping insertion in model container [2025-03-17 11:04:24,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:24" (2/3) ... [2025-03-17 11:04:24,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211547f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:24, skipping insertion in model container [2025-03-17 11:04:24,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:24" (3/3) ... [2025-03-17 11:04:24,943 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2025-03-17 11:04:24,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:04:24,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.i that has 2 procedures, 157 locations, 1 initial locations, 3 loop locations, and 4 error locations. [2025-03-17 11:04:24,956 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:04:25,025 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:04:25,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 159 transitions, 322 flow [2025-03-17 11:04:25,128 INFO L124 PetriNetUnfolderBase]: 3/158 cut-off events. [2025-03-17 11:04:25,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:25,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 3/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 130 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-17 11:04:25,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 159 transitions, 322 flow [2025-03-17 11:04:25,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 319 flow [2025-03-17 11:04:25,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:04:25,157 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;@7e90127c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:04:25,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:04:25,179 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:04:25,180 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-17 11:04:25,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:25,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:25,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:25,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:25,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:25,185 INFO L85 PathProgramCache]: Analyzing trace with hash 58403481, now seen corresponding path program 1 times [2025-03-17 11:04:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-17 11:04:25,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:25,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 11:04:25,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 11:04:25,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:25,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-17 11:04:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702436604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:04:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982427560] [2025-03-17 11:04:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:25,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:25,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:25,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:25,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 159 [2025-03-17 11:04:25,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 158 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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-17 11:04:25,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:25,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 159 [2025-03-17 11:04:25,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:25,616 INFO L124 PetriNetUnfolderBase]: 13/246 cut-off events. [2025-03-17 11:04:25,617 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:25,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 246 events. 13/246 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 408 event pairs, 6 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 183. Up to 28 conditions per place. [2025-03-17 11:04:25,620 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-17 11:04:25,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 345 flow [2025-03-17 11:04:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-17 11:04:25,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9580712788259959 [2025-03-17 11:04:25,635 INFO L175 Difference]: Start difference. First operand has 159 places, 158 transitions, 319 flow. Second operand 3 states and 457 transitions. [2025-03-17 11:04:25,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 345 flow [2025-03-17 11:04:25,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:25,643 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 330 flow [2025-03-17 11:04:25,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2025-03-17 11:04:25,649 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 2 predicate places. [2025-03-17 11:04:25,650 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 330 flow [2025-03-17 11:04:25,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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-17 11:04:25,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:25,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:25,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:04:25,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:25,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash -53489937, now seen corresponding path program 1 times [2025-03-17 11:04:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733631777] [2025-03-17 11:04:25,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:25,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:04:25,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:04:25,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:25,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:25,846 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-17 11:04:25,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733631777] [2025-03-17 11:04:25,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733631777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322363588] [2025-03-17 11:04:25,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:25,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:25,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:25,849 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-17 11:04:25,851 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-17 11:04:25,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:04:25,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:04:25,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:25,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:25,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:04:25,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:25,990 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-17 11:04:25,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:26,031 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-17 11:04:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322363588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:26,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:26,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:04:26,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199253262] [2025-03-17 11:04:26,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:26,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:26,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:26,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:04:26,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-17 11:04:26,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 330 flow. Second operand has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 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-17 11:04:26,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:26,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-17 11:04:26,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:26,187 INFO L124 PetriNetUnfolderBase]: 13/253 cut-off events. [2025-03-17 11:04:26,187 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:26,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 253 events. 13/253 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 403 event pairs, 6 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 221. Up to 28 conditions per place. [2025-03-17 11:04:26,191 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 14 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2025-03-17 11:04:26,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 167 transitions, 394 flow [2025-03-17 11:04:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1330 transitions. [2025-03-17 11:04:26,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294199860237596 [2025-03-17 11:04:26,194 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 330 flow. Second operand 9 states and 1330 transitions. [2025-03-17 11:04:26,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 167 transitions, 394 flow [2025-03-17 11:04:26,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 167 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:26,199 INFO L231 Difference]: Finished difference. Result has 171 places, 165 transitions, 378 flow [2025-03-17 11:04:26,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=171, PETRI_TRANSITIONS=165} [2025-03-17 11:04:26,200 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 12 predicate places. [2025-03-17 11:04:26,201 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 165 transitions, 378 flow [2025-03-17 11:04:26,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 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-17 11:04:26,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:26,202 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:26,209 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-17 11:04:26,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:26,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:26,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 964289103, now seen corresponding path program 2 times [2025-03-17 11:04:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029081515] [2025-03-17 11:04:26,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:26,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-17 11:04:26,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-03-17 11:04:26,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:26,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:04:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029081515] [2025-03-17 11:04:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029081515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:26,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:26,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:26,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593409884] [2025-03-17 11:04:26,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:26,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:26,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:26,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:27,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-03-17 11:04:27,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 165 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-17 11:04:27,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:27,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-03-17 11:04:27,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:27,216 INFO L124 PetriNetUnfolderBase]: 150/840 cut-off events. [2025-03-17 11:04:27,216 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:04:27,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 840 events. 150/840 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4726 event pairs, 62 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1057. Up to 240 conditions per place. [2025-03-17 11:04:27,221 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 30 selfloop transitions, 22 changer transitions 0/194 dead transitions. [2025-03-17 11:04:27,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 194 transitions, 540 flow [2025-03-17 11:04:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-03-17 11:04:27,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-03-17 11:04:27,223 INFO L175 Difference]: Start difference. First operand has 171 places, 165 transitions, 378 flow. Second operand 6 states and 869 transitions. [2025-03-17 11:04:27,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 194 transitions, 540 flow [2025-03-17 11:04:27,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 534 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:27,228 INFO L231 Difference]: Finished difference. Result has 180 places, 186 transitions, 522 flow [2025-03-17 11:04:27,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=180, PETRI_TRANSITIONS=186} [2025-03-17 11:04:27,229 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 21 predicate places. [2025-03-17 11:04:27,230 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 186 transitions, 522 flow [2025-03-17 11:04:27,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-17 11:04:27,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:27,230 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:27,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:04:27,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:27,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash -510722374, now seen corresponding path program 1 times [2025-03-17 11:04:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124300753] [2025-03-17 11:04:27,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:27,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 11:04:27,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 11:04:27,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:27,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:27,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124300753] [2025-03-17 11:04:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124300753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688433282] [2025-03-17 11:04:27,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:27,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:27,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:27,436 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-17 11:04:27,437 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-17 11:04:27,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 11:04:27,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 11:04:27,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:27,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:27,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:04:27,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:27,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688433282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:27,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:27,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:04:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382724016] [2025-03-17 11:04:27,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:27,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:04:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:27,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:04:27,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:04:27,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-17 11:04:27,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 186 transitions, 522 flow. Second operand has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 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-17 11:04:27,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:27,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-17 11:04:27,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:27,953 INFO L124 PetriNetUnfolderBase]: 61/586 cut-off events. [2025-03-17 11:04:27,953 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-03-17 11:04:27,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 586 events. 61/586 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2307 event pairs, 11 based on Foata normal form. 4/556 useless extension candidates. Maximal degree in co-relation 693. Up to 63 conditions per place. [2025-03-17 11:04:27,958 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 18 selfloop transitions, 21 changer transitions 0/204 dead transitions. [2025-03-17 11:04:27,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 204 transitions, 688 flow [2025-03-17 11:04:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:04:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:04:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3088 transitions. [2025-03-17 11:04:27,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2025-03-17 11:04:27,965 INFO L175 Difference]: Start difference. First operand has 180 places, 186 transitions, 522 flow. Second operand 21 states and 3088 transitions. [2025-03-17 11:04:27,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 204 transitions, 688 flow [2025-03-17 11:04:27,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 204 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:27,975 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 652 flow [2025-03-17 11:04:27,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=652, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2025-03-17 11:04:27,977 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 46 predicate places. [2025-03-17 11:04:27,977 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 652 flow [2025-03-17 11:04:27,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 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-17 11:04:27,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:27,979 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:27,985 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-17 11:04:28,179 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-17 11:04:28,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:28,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash -134283910, now seen corresponding path program 2 times [2025-03-17 11:04:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:28,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91623581] [2025-03-17 11:04:28,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:28,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-17 11:04:28,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-03-17 11:04:28,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:28,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 11:04:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91623581] [2025-03-17 11:04:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91623581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:28,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:28,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655165528] [2025-03-17 11:04:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:28,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:28,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:28,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:28,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:28,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-03-17 11:04:28,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-17 11:04:28,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:28,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-03-17 11:04:28,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:28,800 INFO L124 PetriNetUnfolderBase]: 206/1098 cut-off events. [2025-03-17 11:04:28,800 INFO L125 PetriNetUnfolderBase]: For 224/244 co-relation queries the response was YES. [2025-03-17 11:04:28,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1098 events. 206/1098 cut-off events. For 224/244 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6568 event pairs, 62 based on Foata normal form. 5/1041 useless extension candidates. Maximal degree in co-relation 1691. Up to 330 conditions per place. [2025-03-17 11:04:28,808 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 47 selfloop transitions, 30 changer transitions 0/236 dead transitions. [2025-03-17 11:04:28,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 236 transitions, 922 flow [2025-03-17 11:04:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-03-17 11:04:28,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-03-17 11:04:28,810 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 652 flow. Second operand 6 states and 869 transitions. [2025-03-17 11:04:28,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 236 transitions, 922 flow [2025-03-17 11:04:28,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 236 transitions, 898 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:04:28,818 INFO L231 Difference]: Finished difference. Result has 209 places, 228 transitions, 878 flow [2025-03-17 11:04:28,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=209, PETRI_TRANSITIONS=228} [2025-03-17 11:04:28,819 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 50 predicate places. [2025-03-17 11:04:28,821 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 228 transitions, 878 flow [2025-03-17 11:04:28,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-17 11:04:28,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:28,822 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:28,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:04:28,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 822536851, now seen corresponding path program 1 times [2025-03-17 11:04:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615612085] [2025-03-17 11:04:28,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:28,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 11:04:28,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 11:04:28,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:28,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:29,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615612085] [2025-03-17 11:04:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615612085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:29,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679179456] [2025-03-17 11:04:29,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:29,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:29,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:29,109 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-17 11:04:29,111 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-17 11:04:29,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 11:04:29,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 11:04:29,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:29,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:29,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:04:29,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:29,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679179456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:29,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 11:04:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530880169] [2025-03-17 11:04:29,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:04:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:29,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:04:29,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:04:29,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-17 11:04:29,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 228 transitions, 878 flow. Second operand has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 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-17 11:04:29,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:29,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-17 11:04:29,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:29,830 INFO L124 PetriNetUnfolderBase]: 117/846 cut-off events. [2025-03-17 11:04:29,830 INFO L125 PetriNetUnfolderBase]: For 345/358 co-relation queries the response was YES. [2025-03-17 11:04:29,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 846 events. 117/846 cut-off events. For 345/358 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4344 event pairs, 14 based on Foata normal form. 8/817 useless extension candidates. Maximal degree in co-relation 1309. Up to 84 conditions per place. [2025-03-17 11:04:29,837 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 21 selfloop transitions, 30 changer transitions 0/245 dead transitions. [2025-03-17 11:04:29,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 245 transitions, 1102 flow [2025-03-17 11:04:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:04:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:04:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4404 transitions. [2025-03-17 11:04:29,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9232704402515723 [2025-03-17 11:04:29,844 INFO L175 Difference]: Start difference. First operand has 209 places, 228 transitions, 878 flow. Second operand 30 states and 4404 transitions. [2025-03-17 11:04:29,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 245 transitions, 1102 flow [2025-03-17 11:04:29,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 245 transitions, 1102 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:29,851 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 1030 flow [2025-03-17 11:04:29,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1030, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2025-03-17 11:04:29,853 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 83 predicate places. [2025-03-17 11:04:29,853 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 1030 flow [2025-03-17 11:04:29,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 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-17 11:04:29,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:29,855 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:29,862 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-17 11:04:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:30,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:30,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1288711122, now seen corresponding path program 2 times [2025-03-17 11:04:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:30,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276645903] [2025-03-17 11:04:30,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:30,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-17 11:04:30,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-03-17 11:04:30,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:30,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:30,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276645903] [2025-03-17 11:04:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276645903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603385717] [2025-03-17 11:04:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:30,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:30,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-03-17 11:04:30,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 1030 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-17 11:04:30,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:30,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-03-17 11:04:30,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:30,639 INFO L124 PetriNetUnfolderBase]: 422/1653 cut-off events. [2025-03-17 11:04:30,639 INFO L125 PetriNetUnfolderBase]: For 998/1040 co-relation queries the response was YES. [2025-03-17 11:04:30,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1653 events. 422/1653 cut-off events. For 998/1040 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10470 event pairs, 107 based on Foata normal form. 12/1574 useless extension candidates. Maximal degree in co-relation 3386. Up to 718 conditions per place. [2025-03-17 11:04:30,648 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 76 selfloop transitions, 57 changer transitions 0/293 dead transitions. [2025-03-17 11:04:30,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 293 transitions, 1540 flow [2025-03-17 11:04:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-03-17 11:04:30,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-03-17 11:04:30,651 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 1030 flow. Second operand 6 states and 855 transitions. [2025-03-17 11:04:30,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 293 transitions, 1540 flow [2025-03-17 11:04:30,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 293 transitions, 1494 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-17 11:04:30,659 INFO L231 Difference]: Finished difference. Result has 234 places, 285 transitions, 1482 flow [2025-03-17 11:04:30,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1482, PETRI_PLACES=234, PETRI_TRANSITIONS=285} [2025-03-17 11:04:30,660 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 75 predicate places. [2025-03-17 11:04:30,660 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 285 transitions, 1482 flow [2025-03-17 11:04:30,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-17 11:04:30,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:30,660 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:04:30,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:30,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1403844971, now seen corresponding path program 1 times [2025-03-17 11:04:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:30,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-17 11:04:30,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:30,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:04:30,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:04:30,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:30,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:30,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-17 11:04:30,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059241389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:30,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:30,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133254552] [2025-03-17 11:04:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:30,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:30,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:30,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:31,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-03-17 11:04:31,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 285 transitions, 1482 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-17 11:04:31,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:31,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-03-17 11:04:31,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:31,422 INFO L124 PetriNetUnfolderBase]: 542/2093 cut-off events. [2025-03-17 11:04:31,423 INFO L125 PetriNetUnfolderBase]: For 2322/2378 co-relation queries the response was YES. [2025-03-17 11:04:31,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 2093 events. 542/2093 cut-off events. For 2322/2378 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14554 event pairs, 113 based on Foata normal form. 13/2020 useless extension candidates. Maximal degree in co-relation 5000. Up to 894 conditions per place. [2025-03-17 11:04:31,436 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 113 selfloop transitions, 71 changer transitions 0/346 dead transitions. [2025-03-17 11:04:31,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 346 transitions, 2204 flow [2025-03-17 11:04:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-03-17 11:04:31,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-03-17 11:04:31,438 INFO L175 Difference]: Start difference. First operand has 234 places, 285 transitions, 1482 flow. Second operand 6 states and 855 transitions. [2025-03-17 11:04:31,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 346 transitions, 2204 flow [2025-03-17 11:04:31,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 346 transitions, 2140 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:31,454 INFO L231 Difference]: Finished difference. Result has 244 places, 338 transitions, 2094 flow [2025-03-17 11:04:31,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2094, PETRI_PLACES=244, PETRI_TRANSITIONS=338} [2025-03-17 11:04:31,455 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 85 predicate places. [2025-03-17 11:04:31,456 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 338 transitions, 2094 flow [2025-03-17 11:04:31,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-17 11:04:31,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:31,457 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:31,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:04:31,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:31,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -127173682, now seen corresponding path program 1 times [2025-03-17 11:04:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244652778] [2025-03-17 11:04:31,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:31,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:31,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 11:04:31,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:31,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:31,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:31,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:31,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244652778] [2025-03-17 11:04:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244652778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42491079] [2025-03-17 11:04:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:31,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:04:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:31,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:04:31,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:04:32,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:32,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 338 transitions, 2094 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:32,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:32,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:32,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:33,564 INFO L124 PetriNetUnfolderBase]: 1065/4194 cut-off events. [2025-03-17 11:04:33,564 INFO L125 PetriNetUnfolderBase]: For 5455/5582 co-relation queries the response was YES. [2025-03-17 11:04:33,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11555 conditions, 4194 events. 1065/4194 cut-off events. For 5455/5582 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 33442 event pairs, 161 based on Foata normal form. 43/4211 useless extension candidates. Maximal degree in co-relation 11278. Up to 580 conditions per place. [2025-03-17 11:04:33,590 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 65 selfloop transitions, 15 changer transitions 6/397 dead transitions. [2025-03-17 11:04:33,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 397 transitions, 2384 flow [2025-03-17 11:04:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1277 transitions. [2025-03-17 11:04:33,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923829489867225 [2025-03-17 11:04:33,592 INFO L175 Difference]: Start difference. First operand has 244 places, 338 transitions, 2094 flow. Second operand 9 states and 1277 transitions. [2025-03-17 11:04:33,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 397 transitions, 2384 flow [2025-03-17 11:04:33,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 397 transitions, 2302 flow, removed 41 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:33,623 INFO L231 Difference]: Finished difference. Result has 259 places, 353 transitions, 2130 flow [2025-03-17 11:04:33,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2130, PETRI_PLACES=259, PETRI_TRANSITIONS=353} [2025-03-17 11:04:33,624 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 100 predicate places. [2025-03-17 11:04:33,624 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 353 transitions, 2130 flow [2025-03-17 11:04:33,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:33,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:33,625 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:33,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:04:33,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:33,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2133135914, now seen corresponding path program 2 times [2025-03-17 11:04:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180233831] [2025-03-17 11:04:33,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:33,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-17 11:04:33,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:04:33,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:33,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:33,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:33,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180233831] [2025-03-17 11:04:33,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180233831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:33,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:33,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848532016] [2025-03-17 11:04:33,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:33,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:04:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:33,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:04:33,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:04:34,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:34,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 353 transitions, 2130 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:34,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:34,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:34,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:36,099 INFO L124 PetriNetUnfolderBase]: 2043/7589 cut-off events. [2025-03-17 11:04:36,099 INFO L125 PetriNetUnfolderBase]: For 10654/10918 co-relation queries the response was YES. [2025-03-17 11:04:36,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22326 conditions, 7589 events. 2043/7589 cut-off events. For 10654/10918 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 68054 event pairs, 270 based on Foata normal form. 87/7623 useless extension candidates. Maximal degree in co-relation 22041. Up to 1199 conditions per place. [2025-03-17 11:04:36,147 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 110 selfloop transitions, 20 changer transitions 3/444 dead transitions. [2025-03-17 11:04:36,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 444 transitions, 2796 flow [2025-03-17 11:04:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1276 transitions. [2025-03-17 11:04:36,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916841369671559 [2025-03-17 11:04:36,150 INFO L175 Difference]: Start difference. First operand has 259 places, 353 transitions, 2130 flow. Second operand 9 states and 1276 transitions. [2025-03-17 11:04:36,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 444 transitions, 2796 flow [2025-03-17 11:04:36,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 444 transitions, 2796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:36,200 INFO L231 Difference]: Finished difference. Result has 274 places, 370 transitions, 2310 flow [2025-03-17 11:04:36,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2310, PETRI_PLACES=274, PETRI_TRANSITIONS=370} [2025-03-17 11:04:36,201 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 115 predicate places. [2025-03-17 11:04:36,201 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 370 transitions, 2310 flow [2025-03-17 11:04:36,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:36,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:36,202 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:36,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:04:36,202 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:36,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1937279128, now seen corresponding path program 3 times [2025-03-17 11:04:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:36,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969138177] [2025-03-17 11:04:36,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:04:36,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:36,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:04:36,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:04:36,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:04:36,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:36,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:36,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969138177] [2025-03-17 11:04:36,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969138177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:36,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:36,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770540038] [2025-03-17 11:04:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:36,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:04:36,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:36,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:04:36,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:04:37,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:37,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 370 transitions, 2310 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:37,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:37,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:37,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:38,826 INFO L124 PetriNetUnfolderBase]: 2340/8669 cut-off events. [2025-03-17 11:04:38,826 INFO L125 PetriNetUnfolderBase]: For 14374/14765 co-relation queries the response was YES. [2025-03-17 11:04:38,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26804 conditions, 8669 events. 2340/8669 cut-off events. For 14374/14765 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 79107 event pairs, 290 based on Foata normal form. 92/8704 useless extension candidates. Maximal degree in co-relation 26511. Up to 1318 conditions per place. [2025-03-17 11:04:38,885 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 117 selfloop transitions, 22 changer transitions 4/454 dead transitions. [2025-03-17 11:04:38,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 454 transitions, 3094 flow [2025-03-17 11:04:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1281 transitions. [2025-03-17 11:04:38,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951781970649895 [2025-03-17 11:04:38,888 INFO L175 Difference]: Start difference. First operand has 274 places, 370 transitions, 2310 flow. Second operand 9 states and 1281 transitions. [2025-03-17 11:04:38,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 454 transitions, 3094 flow [2025-03-17 11:04:38,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 454 transitions, 3056 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:38,962 INFO L231 Difference]: Finished difference. Result has 287 places, 382 transitions, 2479 flow [2025-03-17 11:04:38,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2479, PETRI_PLACES=287, PETRI_TRANSITIONS=382} [2025-03-17 11:04:38,963 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 128 predicate places. [2025-03-17 11:04:38,963 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 382 transitions, 2479 flow [2025-03-17 11:04:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:38,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:38,964 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:38,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:04:38,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:38,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1568050520, now seen corresponding path program 4 times [2025-03-17 11:04:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:38,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284320296] [2025-03-17 11:04:38,966 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:04:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:38,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-17 11:04:39,014 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:39,014 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:04:39,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:39,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284320296] [2025-03-17 11:04:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284320296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:39,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:04:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479712375] [2025-03-17 11:04:39,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:39,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:39,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:04:40,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:40,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 382 transitions, 2479 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:04:40,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:40,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:40,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:41,903 INFO L124 PetriNetUnfolderBase]: 2637/9665 cut-off events. [2025-03-17 11:04:41,904 INFO L125 PetriNetUnfolderBase]: For 18057/18461 co-relation queries the response was YES. [2025-03-17 11:04:41,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30618 conditions, 9665 events. 2637/9665 cut-off events. For 18057/18461 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 90372 event pairs, 291 based on Foata normal form. 107/9708 useless extension candidates. Maximal degree in co-relation 30319. Up to 1582 conditions per place. [2025-03-17 11:04:41,959 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 131 selfloop transitions, 28 changer transitions 2/472 dead transitions. [2025-03-17 11:04:41,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 472 transitions, 3428 flow [2025-03-17 11:04:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:04:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:04:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1413 transitions. [2025-03-17 11:04:41,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8886792452830189 [2025-03-17 11:04:41,961 INFO L175 Difference]: Start difference. First operand has 287 places, 382 transitions, 2479 flow. Second operand 10 states and 1413 transitions. [2025-03-17 11:04:41,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 472 transitions, 3428 flow [2025-03-17 11:04:42,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 472 transitions, 3349 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-17 11:04:42,033 INFO L231 Difference]: Finished difference. Result has 298 places, 394 transitions, 2657 flow [2025-03-17 11:04:42,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2657, PETRI_PLACES=298, PETRI_TRANSITIONS=394} [2025-03-17 11:04:42,035 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 139 predicate places. [2025-03-17 11:04:42,035 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 394 transitions, 2657 flow [2025-03-17 11:04:42,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:04:42,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:42,036 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:04:42,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1804186006, now seen corresponding path program 5 times [2025-03-17 11:04:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847449177] [2025-03-17 11:04:42,037 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:04:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:42,052 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:04:42,071 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:42,071 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:04:42,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-17 11:04:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:42,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847449177] [2025-03-17 11:04:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847449177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:42,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214733263] [2025-03-17 11:04:42,652 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:04:42,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:42,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:42,654 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-17 11:04:42,656 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-17 11:04:42,717 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:04:42,775 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:42,776 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:04:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:42,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:04:42,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:43,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:04:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:43,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:04:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214733263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:43,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:04:43,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-17 11:04:43,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849135972] [2025-03-17 11:04:43,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:43,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:43,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:43,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:43,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:04:43,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:43,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 394 transitions, 2657 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:04:43,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:43,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:43,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:45,946 INFO L124 PetriNetUnfolderBase]: 2967/10860 cut-off events. [2025-03-17 11:04:45,946 INFO L125 PetriNetUnfolderBase]: For 23040/23555 co-relation queries the response was YES. [2025-03-17 11:04:45,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35145 conditions, 10860 events. 2967/10860 cut-off events. For 23040/23555 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 104240 event pairs, 320 based on Foata normal form. 101/10883 useless extension candidates. Maximal degree in co-relation 34840. Up to 1710 conditions per place. [2025-03-17 11:04:46,015 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 132 selfloop transitions, 30 changer transitions 2/475 dead transitions. [2025-03-17 11:04:46,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 475 transitions, 3636 flow [2025-03-17 11:04:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:04:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:04:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1416 transitions. [2025-03-17 11:04:46,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905660377358491 [2025-03-17 11:04:46,018 INFO L175 Difference]: Start difference. First operand has 298 places, 394 transitions, 2657 flow. Second operand 10 states and 1416 transitions. [2025-03-17 11:04:46,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 475 transitions, 3636 flow [2025-03-17 11:04:46,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 475 transitions, 3543 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-17 11:04:46,117 INFO L231 Difference]: Finished difference. Result has 309 places, 409 transitions, 2895 flow [2025-03-17 11:04:46,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2614, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2895, PETRI_PLACES=309, PETRI_TRANSITIONS=409} [2025-03-17 11:04:46,119 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 150 predicate places. [2025-03-17 11:04:46,119 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 409 transitions, 2895 flow [2025-03-17 11:04:46,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:04:46,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:46,120 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:46,129 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-17 11:04:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:46,321 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 635560986, now seen corresponding path program 6 times [2025-03-17 11:04:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505048601] [2025-03-17 11:04:46,322 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:04:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:46,333 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:04:46,343 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:04:46,343 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 11:04:46,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505048601] [2025-03-17 11:04:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505048601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:46,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898122169] [2025-03-17 11:04:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:46,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:04:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:46,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:04:46,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:04:47,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:47,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 409 transitions, 2895 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:47,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:47,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:47,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:49,032 INFO L124 PetriNetUnfolderBase]: 3289/11984 cut-off events. [2025-03-17 11:04:49,033 INFO L125 PetriNetUnfolderBase]: For 28994/29530 co-relation queries the response was YES. [2025-03-17 11:04:49,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39652 conditions, 11984 events. 3289/11984 cut-off events. For 28994/29530 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 117775 event pairs, 342 based on Foata normal form. 108/12004 useless extension candidates. Maximal degree in co-relation 39341. Up to 1958 conditions per place. [2025-03-17 11:04:49,126 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 149 selfloop transitions, 34 changer transitions 1/495 dead transitions. [2025-03-17 11:04:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 495 transitions, 4019 flow [2025-03-17 11:04:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2025-03-17 11:04:49,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972746331236897 [2025-03-17 11:04:49,127 INFO L175 Difference]: Start difference. First operand has 309 places, 409 transitions, 2895 flow. Second operand 9 states and 1284 transitions. [2025-03-17 11:04:49,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 495 transitions, 4019 flow [2025-03-17 11:04:49,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 495 transitions, 3921 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-03-17 11:04:49,252 INFO L231 Difference]: Finished difference. Result has 320 places, 424 transitions, 3136 flow [2025-03-17 11:04:49,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2834, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3136, PETRI_PLACES=320, PETRI_TRANSITIONS=424} [2025-03-17 11:04:49,252 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 161 predicate places. [2025-03-17 11:04:49,253 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 424 transitions, 3136 flow [2025-03-17 11:04:49,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:49,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:49,253 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:49,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:04:49,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:49,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -667915674, now seen corresponding path program 7 times [2025-03-17 11:04:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:49,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272655700] [2025-03-17 11:04:49,255 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:04:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:49,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 11:04:49,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:49,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:49,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272655700] [2025-03-17 11:04:49,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272655700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:49,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:49,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:49,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687138046] [2025-03-17 11:04:49,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:49,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:04:49,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:49,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:04:49,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:04:50,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:50,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 424 transitions, 3136 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:50,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:50,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:50,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:52,133 INFO L124 PetriNetUnfolderBase]: 3634/13228 cut-off events. [2025-03-17 11:04:52,133 INFO L125 PetriNetUnfolderBase]: For 37324/37924 co-relation queries the response was YES. [2025-03-17 11:04:52,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44938 conditions, 13228 events. 3634/13228 cut-off events. For 37324/37924 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 133126 event pairs, 416 based on Foata normal form. 96/13220 useless extension candidates. Maximal degree in co-relation 44622. Up to 2114 conditions per place. [2025-03-17 11:04:52,213 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 148 selfloop transitions, 36 changer transitions 0/495 dead transitions. [2025-03-17 11:04:52,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 495 transitions, 4233 flow [2025-03-17 11:04:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2025-03-17 11:04:52,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986722571628232 [2025-03-17 11:04:52,215 INFO L175 Difference]: Start difference. First operand has 320 places, 424 transitions, 3136 flow. Second operand 9 states and 1286 transitions. [2025-03-17 11:04:52,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 495 transitions, 4233 flow [2025-03-17 11:04:52,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 495 transitions, 4133 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-03-17 11:04:52,363 INFO L231 Difference]: Finished difference. Result has 333 places, 443 transitions, 3486 flow [2025-03-17 11:04:52,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3058, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3486, PETRI_PLACES=333, PETRI_TRANSITIONS=443} [2025-03-17 11:04:52,364 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 174 predicate places. [2025-03-17 11:04:52,364 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 443 transitions, 3486 flow [2025-03-17 11:04:52,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:52,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:52,365 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:52,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:04:52,365 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:52,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1468514462, now seen corresponding path program 8 times [2025-03-17 11:04:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858669413] [2025-03-17 11:04:52,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:52,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-17 11:04:52,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:04:52,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:52,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:52,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:52,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858669413] [2025-03-17 11:04:52,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858669413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:52,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:52,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262467289] [2025-03-17 11:04:52,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:52,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:04:52,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:52,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:04:52,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:04:52,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:52,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 443 transitions, 3486 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:52,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:52,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:52,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:55,564 INFO L124 PetriNetUnfolderBase]: 4229/15194 cut-off events. [2025-03-17 11:04:55,564 INFO L125 PetriNetUnfolderBase]: For 48162/48925 co-relation queries the response was YES. [2025-03-17 11:04:55,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52664 conditions, 15194 events. 4229/15194 cut-off events. For 48162/48925 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 158567 event pairs, 434 based on Foata normal form. 127/15206 useless extension candidates. Maximal degree in co-relation 52341. Up to 2504 conditions per place. [2025-03-17 11:04:55,730 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 169 selfloop transitions, 45 changer transitions 0/525 dead transitions. [2025-03-17 11:04:55,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 525 transitions, 4789 flow [2025-03-17 11:04:55,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1288 transitions. [2025-03-17 11:04:55,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000698812019566 [2025-03-17 11:04:55,732 INFO L175 Difference]: Start difference. First operand has 333 places, 443 transitions, 3486 flow. Second operand 9 states and 1288 transitions. [2025-03-17 11:04:55,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 525 transitions, 4789 flow [2025-03-17 11:04:55,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 525 transitions, 4685 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:55,971 INFO L231 Difference]: Finished difference. Result has 348 places, 461 transitions, 3838 flow [2025-03-17 11:04:55,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3382, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3838, PETRI_PLACES=348, PETRI_TRANSITIONS=461} [2025-03-17 11:04:55,972 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 189 predicate places. [2025-03-17 11:04:55,972 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 461 transitions, 3838 flow [2025-03-17 11:04:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:55,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:55,973 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:55,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:04:55,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:55,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:55,974 INFO L85 PathProgramCache]: Analyzing trace with hash 884688178, now seen corresponding path program 9 times [2025-03-17 11:04:55,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:55,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128547579] [2025-03-17 11:04:55,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:04:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:55,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:04:55,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:04:55,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:04:55,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:56,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128547579] [2025-03-17 11:04:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128547579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:56,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174988631] [2025-03-17 11:04:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:56,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:04:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:56,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:04:56,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:04:56,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:04:56,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 461 transitions, 3838 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:56,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:56,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:04:56,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:59,096 INFO L124 PetriNetUnfolderBase]: 4818/17260 cut-off events. [2025-03-17 11:04:59,097 INFO L125 PetriNetUnfolderBase]: For 59775/60645 co-relation queries the response was YES. [2025-03-17 11:04:59,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61007 conditions, 17260 events. 4818/17260 cut-off events. For 59775/60645 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 186162 event pairs, 474 based on Foata normal form. 140/17277 useless extension candidates. Maximal degree in co-relation 60676. Up to 2857 conditions per place. [2025-03-17 11:04:59,316 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 184 selfloop transitions, 46 changer transitions 0/541 dead transitions. [2025-03-17 11:04:59,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 541 transitions, 5096 flow [2025-03-17 11:04:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1288 transitions. [2025-03-17 11:04:59,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000698812019566 [2025-03-17 11:04:59,317 INFO L175 Difference]: Start difference. First operand has 348 places, 461 transitions, 3838 flow. Second operand 9 states and 1288 transitions. [2025-03-17 11:04:59,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 541 transitions, 5096 flow [2025-03-17 11:04:59,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 541 transitions, 5010 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:59,593 INFO L231 Difference]: Finished difference. Result has 362 places, 478 transitions, 4161 flow [2025-03-17 11:04:59,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3752, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4161, PETRI_PLACES=362, PETRI_TRANSITIONS=478} [2025-03-17 11:04:59,594 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 203 predicate places. [2025-03-17 11:04:59,594 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 478 transitions, 4161 flow [2025-03-17 11:04:59,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:04:59,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:59,595 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:04:59,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:04:59,595 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:59,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash 26880902, now seen corresponding path program 10 times [2025-03-17 11:04:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:59,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738282652] [2025-03-17 11:04:59,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:04:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:59,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-17 11:04:59,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:59,622 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:04:59,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738282652] [2025-03-17 11:05:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738282652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:00,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:00,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:05:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245034340] [2025-03-17 11:05:00,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:00,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:00,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:00,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:00,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:00,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 478 transitions, 4161 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:00,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:00,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:00,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:03,613 INFO L124 PetriNetUnfolderBase]: 5106/18198 cut-off events. [2025-03-17 11:05:03,613 INFO L125 PetriNetUnfolderBase]: For 67762/68685 co-relation queries the response was YES. [2025-03-17 11:05:03,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65204 conditions, 18198 events. 5106/18198 cut-off events. For 67762/68685 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 199000 event pairs, 505 based on Foata normal form. 157/18226 useless extension candidates. Maximal degree in co-relation 64866. Up to 3039 conditions per place. [2025-03-17 11:05:03,746 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 182 selfloop transitions, 54 changer transitions 0/547 dead transitions. [2025-03-17 11:05:03,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 547 transitions, 5463 flow [2025-03-17 11:05:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:05:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:05:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1422 transitions. [2025-03-17 11:05:03,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8943396226415095 [2025-03-17 11:05:03,747 INFO L175 Difference]: Start difference. First operand has 362 places, 478 transitions, 4161 flow. Second operand 10 states and 1422 transitions. [2025-03-17 11:05:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 547 transitions, 5463 flow [2025-03-17 11:05:04,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 547 transitions, 5310 flow, removed 57 selfloop flow, removed 2 redundant places. [2025-03-17 11:05:04,053 INFO L231 Difference]: Finished difference. Result has 373 places, 492 transitions, 4442 flow [2025-03-17 11:05:04,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4064, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4442, PETRI_PLACES=373, PETRI_TRANSITIONS=492} [2025-03-17 11:05:04,053 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 214 predicate places. [2025-03-17 11:05:04,053 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 492 transitions, 4442 flow [2025-03-17 11:05:04,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:04,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:04,054 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:04,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:05:04,054 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:04,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1313727442, now seen corresponding path program 11 times [2025-03-17 11:05:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:04,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14454326] [2025-03-17 11:05:04,055 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:04,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:05:04,079 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:05:04,080 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:05:04,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-17 11:05:04,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:04,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14454326] [2025-03-17 11:05:04,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14454326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:04,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466701518] [2025-03-17 11:05:04,536 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:04,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:04,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:04,538 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-17 11:05:04,540 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-17 11:05:04,602 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:05:04,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:05:04,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:05:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:04,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:05:04,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:04,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:05:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:04,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:05:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466701518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:04,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:05:04,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-17 11:05:04,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629117691] [2025-03-17 11:05:04,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:04,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:04,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:04,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:05:05,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:05,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 492 transitions, 4442 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:05,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:05,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:05,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:08,651 INFO L124 PetriNetUnfolderBase]: 5112/18196 cut-off events. [2025-03-17 11:05:08,652 INFO L125 PetriNetUnfolderBase]: For 72586/73531 co-relation queries the response was YES. [2025-03-17 11:05:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65911 conditions, 18196 events. 5112/18196 cut-off events. For 72586/73531 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 198809 event pairs, 506 based on Foata normal form. 165/18227 useless extension candidates. Maximal degree in co-relation 65568. Up to 3047 conditions per place. [2025-03-17 11:05:08,792 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 185 selfloop transitions, 58 changer transitions 0/554 dead transitions. [2025-03-17 11:05:08,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 554 transitions, 5668 flow [2025-03-17 11:05:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:05:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:05:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1423 transitions. [2025-03-17 11:05:08,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8949685534591195 [2025-03-17 11:05:08,962 INFO L175 Difference]: Start difference. First operand has 373 places, 492 transitions, 4442 flow. Second operand 10 states and 1423 transitions. [2025-03-17 11:05:08,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 554 transitions, 5668 flow [2025-03-17 11:05:09,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 554 transitions, 5506 flow, removed 39 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:09,325 INFO L231 Difference]: Finished difference. Result has 382 places, 504 transitions, 4712 flow [2025-03-17 11:05:09,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4304, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4712, PETRI_PLACES=382, PETRI_TRANSITIONS=504} [2025-03-17 11:05:09,326 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 223 predicate places. [2025-03-17 11:05:09,326 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 504 transitions, 4712 flow [2025-03-17 11:05:09,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:09,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:09,326 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:09,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:05:09,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:09,527 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:09,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1446582402, now seen corresponding path program 12 times [2025-03-17 11:05:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205552990] [2025-03-17 11:05:09,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:05:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:09,538 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:05:09,544 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:05:09,544 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 11:05:09,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:09,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205552990] [2025-03-17 11:05:09,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205552990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:09,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:05:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386126042] [2025-03-17 11:05:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:09,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:09,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:10,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:10,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 504 transitions, 4712 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:10,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:10,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:10,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:14,323 INFO L124 PetriNetUnfolderBase]: 5106/18201 cut-off events. [2025-03-17 11:05:14,324 INFO L125 PetriNetUnfolderBase]: For 76573/77578 co-relation queries the response was YES. [2025-03-17 11:05:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66382 conditions, 18201 events. 5106/18201 cut-off events. For 76573/77578 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 199024 event pairs, 508 based on Foata normal form. 161/18226 useless extension candidates. Maximal degree in co-relation 66034. Up to 3043 conditions per place. [2025-03-17 11:05:14,489 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 197 selfloop transitions, 53 changer transitions 0/561 dead transitions. [2025-03-17 11:05:14,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 561 transitions, 5916 flow [2025-03-17 11:05:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:05:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:05:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1426 transitions. [2025-03-17 11:05:14,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8968553459119497 [2025-03-17 11:05:14,490 INFO L175 Difference]: Start difference. First operand has 382 places, 504 transitions, 4712 flow. Second operand 10 states and 1426 transitions. [2025-03-17 11:05:14,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 561 transitions, 5916 flow [2025-03-17 11:05:14,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 561 transitions, 5704 flow, removed 75 selfloop flow, removed 4 redundant places. [2025-03-17 11:05:14,827 INFO L231 Difference]: Finished difference. Result has 391 places, 512 transitions, 4850 flow [2025-03-17 11:05:14,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4850, PETRI_PLACES=391, PETRI_TRANSITIONS=512} [2025-03-17 11:05:14,828 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 232 predicate places. [2025-03-17 11:05:14,828 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 512 transitions, 4850 flow [2025-03-17 11:05:14,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:14,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:14,829 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:14,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:05:14,829 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:14,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1695484842, now seen corresponding path program 13 times [2025-03-17 11:05:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722160521] [2025-03-17 11:05:14,830 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:05:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:14,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 11:05:14,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:05:14,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:14,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:15,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722160521] [2025-03-17 11:05:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722160521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:15,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:05:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347886169] [2025-03-17 11:05:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:05:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:15,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:05:15,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:05:15,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:15,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 512 transitions, 4850 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:05:15,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:15,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:15,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:18,992 INFO L124 PetriNetUnfolderBase]: 5112/18288 cut-off events. [2025-03-17 11:05:18,992 INFO L125 PetriNetUnfolderBase]: For 77116/78120 co-relation queries the response was YES. [2025-03-17 11:05:19,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66760 conditions, 18288 events. 5112/18288 cut-off events. For 77116/78120 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 200431 event pairs, 507 based on Foata normal form. 159/18313 useless extension candidates. Maximal degree in co-relation 66408. Up to 3055 conditions per place. [2025-03-17 11:05:19,248 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 195 selfloop transitions, 60 changer transitions 0/566 dead transitions. [2025-03-17 11:05:19,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 566 transitions, 6008 flow [2025-03-17 11:05:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:05:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:05:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1293 transitions. [2025-03-17 11:05:19,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035639412997903 [2025-03-17 11:05:19,250 INFO L175 Difference]: Start difference. First operand has 391 places, 512 transitions, 4850 flow. Second operand 9 states and 1293 transitions. [2025-03-17 11:05:19,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 566 transitions, 6008 flow [2025-03-17 11:05:19,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 566 transitions, 5918 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:19,663 INFO L231 Difference]: Finished difference. Result has 397 places, 521 transitions, 5087 flow [2025-03-17 11:05:19,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4762, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5087, PETRI_PLACES=397, PETRI_TRANSITIONS=521} [2025-03-17 11:05:19,664 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 238 predicate places. [2025-03-17 11:05:19,664 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 521 transitions, 5087 flow [2025-03-17 11:05:19,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:05:19,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:19,664 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:19,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:05:19,665 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:19,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash 281048110, now seen corresponding path program 14 times [2025-03-17 11:05:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:19,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-03-17 11:05:19,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:19,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-17 11:05:19,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:05:19,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:05:19,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:20,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:20,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-03-17 11:05:20,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595382007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:20,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:20,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:05:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343241859] [2025-03-17 11:05:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:20,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:05:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:20,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:05:20,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:05:20,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:20,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 521 transitions, 5087 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:05:20,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:20,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:20,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:23,445 INFO L124 PetriNetUnfolderBase]: 4845/17496 cut-off events. [2025-03-17 11:05:23,445 INFO L125 PetriNetUnfolderBase]: For 74471/75408 co-relation queries the response was YES. [2025-03-17 11:05:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63932 conditions, 17496 events. 4845/17496 cut-off events. For 74471/75408 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 189721 event pairs, 498 based on Foata normal form. 144/17508 useless extension candidates. Maximal degree in co-relation 63578. Up to 2895 conditions per place. [2025-03-17 11:05:23,685 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 198 selfloop transitions, 59 changer transitions 0/568 dead transitions. [2025-03-17 11:05:23,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 568 transitions, 6144 flow [2025-03-17 11:05:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:05:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:05:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1296 transitions. [2025-03-17 11:05:23,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9056603773584906 [2025-03-17 11:05:23,687 INFO L175 Difference]: Start difference. First operand has 397 places, 521 transitions, 5087 flow. Second operand 9 states and 1296 transitions. [2025-03-17 11:05:23,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 568 transitions, 6144 flow [2025-03-17 11:05:24,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 568 transitions, 6012 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:24,394 INFO L231 Difference]: Finished difference. Result has 403 places, 528 transitions, 5252 flow [2025-03-17 11:05:24,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4914, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5252, PETRI_PLACES=403, PETRI_TRANSITIONS=528} [2025-03-17 11:05:24,395 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 244 predicate places. [2025-03-17 11:05:24,395 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 528 transitions, 5252 flow [2025-03-17 11:05:24,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:05:24,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:24,395 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:05:24,396 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:24,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash -731925810, now seen corresponding path program 15 times [2025-03-17 11:05:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:24,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216247288] [2025-03-17 11:05:24,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:05:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:24,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:05:24,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-17 11:05:24,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:05:24,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:24,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216247288] [2025-03-17 11:05:24,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216247288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:24,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:05:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274033943] [2025-03-17 11:05:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:24,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:05:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:24,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:05:24,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:05:25,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:25,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 528 transitions, 5252 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:05:25,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:25,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:25,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:28,504 INFO L124 PetriNetUnfolderBase]: 4565/16677 cut-off events. [2025-03-17 11:05:28,504 INFO L125 PetriNetUnfolderBase]: For 71271/72144 co-relation queries the response was YES. [2025-03-17 11:05:28,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60831 conditions, 16677 events. 4565/16677 cut-off events. For 71271/72144 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 178846 event pairs, 482 based on Foata normal form. 139/16695 useless extension candidates. Maximal degree in co-relation 60474. Up to 2730 conditions per place. [2025-03-17 11:05:28,724 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 205 selfloop transitions, 60 changer transitions 0/576 dead transitions. [2025-03-17 11:05:28,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 576 transitions, 6326 flow [2025-03-17 11:05:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:05:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:05:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1288 transitions. [2025-03-17 11:05:28,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000698812019566 [2025-03-17 11:05:28,725 INFO L175 Difference]: Start difference. First operand has 403 places, 528 transitions, 5252 flow. Second operand 9 states and 1288 transitions. [2025-03-17 11:05:28,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 576 transitions, 6326 flow [2025-03-17 11:05:29,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 576 transitions, 6170 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:29,075 INFO L231 Difference]: Finished difference. Result has 409 places, 531 transitions, 5299 flow [2025-03-17 11:05:29,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5054, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5299, PETRI_PLACES=409, PETRI_TRANSITIONS=531} [2025-03-17 11:05:29,075 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 250 predicate places. [2025-03-17 11:05:29,075 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 531 transitions, 5299 flow [2025-03-17 11:05:29,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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-17 11:05:29,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:29,076 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:29,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:05:29,076 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:29,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1715608222, now seen corresponding path program 16 times [2025-03-17 11:05:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549091036] [2025-03-17 11:05:29,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:05:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:29,085 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-17 11:05:29,092 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:05:29,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:05:29,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549091036] [2025-03-17 11:05:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549091036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:05:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329609546] [2025-03-17 11:05:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:29,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:29,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:29,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:30,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:30,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 531 transitions, 5299 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:30,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:30,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:30,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:32,765 INFO L124 PetriNetUnfolderBase]: 4573/16726 cut-off events. [2025-03-17 11:05:32,765 INFO L125 PetriNetUnfolderBase]: For 71510/72350 co-relation queries the response was YES. [2025-03-17 11:05:32,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61056 conditions, 16726 events. 4573/16726 cut-off events. For 71510/72350 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 179630 event pairs, 463 based on Foata normal form. 202/16813 useless extension candidates. Maximal degree in co-relation 60696. Up to 2749 conditions per place. [2025-03-17 11:05:32,964 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 204 selfloop transitions, 90 changer transitions 0/605 dead transitions. [2025-03-17 11:05:32,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 605 transitions, 6811 flow [2025-03-17 11:05:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:05:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:05:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1412 transitions. [2025-03-17 11:05:32,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880503144654088 [2025-03-17 11:05:32,966 INFO L175 Difference]: Start difference. First operand has 409 places, 531 transitions, 5299 flow. Second operand 10 states and 1412 transitions. [2025-03-17 11:05:32,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 605 transitions, 6811 flow [2025-03-17 11:05:33,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 605 transitions, 6689 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-17 11:05:33,319 INFO L231 Difference]: Finished difference. Result has 419 places, 542 transitions, 5723 flow [2025-03-17 11:05:33,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5192, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5723, PETRI_PLACES=419, PETRI_TRANSITIONS=542} [2025-03-17 11:05:33,320 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 260 predicate places. [2025-03-17 11:05:33,320 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 542 transitions, 5723 flow [2025-03-17 11:05:33,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:33,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:33,321 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:33,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:05:33,321 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:33,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash 366914258, now seen corresponding path program 17 times [2025-03-17 11:05:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:33,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364349708] [2025-03-17 11:05:33,322 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:33,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:33,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:05:33,336 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:05:33,336 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:05:33,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-17 11:05:33,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:33,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364349708] [2025-03-17 11:05:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364349708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:33,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748070484] [2025-03-17 11:05:33,614 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:33,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:33,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:33,616 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-17 11:05:33,618 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-17 11:05:33,695 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-17 11:05:33,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:05:33,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:05:33,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:33,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:05:33,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:33,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:05:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:33,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:05:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748070484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:05:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-17 11:05:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667458604] [2025-03-17 11:05:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:33,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:33,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:33,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:05:34,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-17 11:05:34,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 542 transitions, 5723 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-17 11:05:34,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:34,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-17 11:05:34,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand