./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:57:46,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:57:46,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:57:46,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:57:46,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:57:46,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:57:46,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:57:46,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:57:46,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:57:46,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:57:46,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:57:46,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:57:46,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:57:46,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:46,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:57:46,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:57:46,262 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2025-03-04 06:57:46,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:57:46,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:57:46,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:57:46,523 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:57:46,523 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:57:46,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-03-04 06:57:47,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f9e24c1/3d8d0754eb3f405996bce840141b80fb/FLAG79c7c4c98 [2025-03-04 06:57:48,016 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:57:48,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-03-04 06:57:48,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f9e24c1/3d8d0754eb3f405996bce840141b80fb/FLAG79c7c4c98 [2025-03-04 06:57:48,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f9e24c1/3d8d0754eb3f405996bce840141b80fb [2025-03-04 06:57:48,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:57:48,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:57:48,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:48,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:57:48,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:57:48,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48, skipping insertion in model container [2025-03-04 06:57:48,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:57:48,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:48,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:57:48,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:48,518 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:57:48,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48 WrapperNode [2025-03-04 06:57:48,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:48,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:48,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:57:48,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:57:48,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,564 INFO L138 Inliner]: procedures = 261, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-04 06:57:48,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:48,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:57:48,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:57:48,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:57:48,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:57:48,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:57:48,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:57:48,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:57:48,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (1/1) ... [2025-03-04 06:57:48,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:48,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:48,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:57:48,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:57:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:57:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:57:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:57:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:57:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:57:48,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:57:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:57:48,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:57:48,640 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:57:48,750 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:57:48,752 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:57:48,928 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:57:48,928 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:57:48,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:57:48,941 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:57:48,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:48 BoogieIcfgContainer [2025-03-04 06:57:48,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:57:48,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:57:48,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:57:48,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:57:48,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:57:48" (1/3) ... [2025-03-04 06:57:48,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce40bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:48, skipping insertion in model container [2025-03-04 06:57:48,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:48" (2/3) ... [2025-03-04 06:57:48,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce40bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:48, skipping insertion in model container [2025-03-04 06:57:48,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:48" (3/3) ... [2025-03-04 06:57:48,949 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2025-03-04 06:57:48,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:57:48,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-init.i that has 2 procedures, 86 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 06:57:48,964 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:57:49,024 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:57:49,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 88 transitions, 183 flow [2025-03-04 06:57:49,106 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-03-04 06:57:49,108 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:57:49,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 2/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 188 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-03-04 06:57:49,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 88 transitions, 183 flow [2025-03-04 06:57:49,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 88 transitions, 183 flow [2025-03-04 06:57:49,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:49,132 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;@248e12f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:49,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 06:57:49,140 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:49,141 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-03-04 06:57:49,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:49,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:49,141 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] [2025-03-04 06:57:49,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1825531627, now seen corresponding path program 1 times [2025-03-04 06:57:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850821825] [2025-03-04 06:57:49,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:49,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 06:57:49,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 06:57:49,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:49,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:49,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:49,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850821825] [2025-03-04 06:57:49,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850821825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:49,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:49,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319012543] [2025-03-04 06:57:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:49,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:49,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:49,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:50,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-03-04 06:57:50,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:50,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:50,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-03-04 06:57:50,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:50,202 INFO L124 PetriNetUnfolderBase]: 91/418 cut-off events. [2025-03-04 06:57:50,202 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:57:50,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 418 events. 91/418 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2026 event pairs, 52 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 559. Up to 197 conditions per place. [2025-03-04 06:57:50,207 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 27 selfloop transitions, 22 changer transitions 1/108 dead transitions. [2025-03-04 06:57:50,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 108 transitions, 321 flow [2025-03-04 06:57:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2025-03-04 06:57:50,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2025-03-04 06:57:50,221 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 6 states and 405 transitions. [2025-03-04 06:57:50,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 108 transitions, 321 flow [2025-03-04 06:57:50,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 108 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:50,230 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 329 flow [2025-03-04 06:57:50,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2025-03-04 06:57:50,235 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2025-03-04 06:57:50,235 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 329 flow [2025-03-04 06:57:50,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:50,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:50,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:50,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:57:50,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1969281508, now seen corresponding path program 1 times [2025-03-04 06:57:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24296940] [2025-03-04 06:57:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:50,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:57:50,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:57:50,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:50,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24296940] [2025-03-04 06:57:50,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24296940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:50,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:50,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123579044] [2025-03-04 06:57:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:50,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:50,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:50,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:50,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 88 [2025-03-04 06:57:50,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:50,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:50,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 88 [2025-03-04 06:57:50,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:50,458 INFO L124 PetriNetUnfolderBase]: 40/253 cut-off events. [2025-03-04 06:57:50,458 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 06:57:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 253 events. 40/253 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 835 event pairs, 4 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 333. Up to 50 conditions per place. [2025-03-04 06:57:50,460 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 11 selfloop transitions, 2 changer transitions 5/112 dead transitions. [2025-03-04 06:57:50,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 375 flow [2025-03-04 06:57:50,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 463 transitions. [2025-03-04 06:57:50,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8768939393939394 [2025-03-04 06:57:50,463 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 329 flow. Second operand 6 states and 463 transitions. [2025-03-04 06:57:50,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 375 flow [2025-03-04 06:57:50,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 112 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:50,466 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 347 flow [2025-03-04 06:57:50,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-03-04 06:57:50,467 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 18 predicate places. [2025-03-04 06:57:50,467 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 347 flow [2025-03-04 06:57:50,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:50,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:50,467 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] [2025-03-04 06:57:50,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:57:50,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:50,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2058554719, now seen corresponding path program 1 times [2025-03-04 06:57:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963116463] [2025-03-04 06:57:50,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:50,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:57:50,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:57:50,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:50,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:50,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963116463] [2025-03-04 06:57:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963116463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:50,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150275916] [2025-03-04 06:57:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:50,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:50,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:50,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-03-04 06:57:50,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:50,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:50,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-03-04 06:57:50,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:51,034 INFO L124 PetriNetUnfolderBase]: 109/469 cut-off events. [2025-03-04 06:57:51,034 INFO L125 PetriNetUnfolderBase]: For 102/105 co-relation queries the response was YES. [2025-03-04 06:57:51,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 469 events. 109/469 cut-off events. For 102/105 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2296 event pairs, 36 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 886. Up to 225 conditions per place. [2025-03-04 06:57:51,039 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 46 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2025-03-04 06:57:51,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 557 flow [2025-03-04 06:57:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2025-03-04 06:57:51,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7651515151515151 [2025-03-04 06:57:51,043 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 347 flow. Second operand 6 states and 404 transitions. [2025-03-04 06:57:51,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 557 flow [2025-03-04 06:57:51,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 128 transitions, 543 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:51,051 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 515 flow [2025-03-04 06:57:51,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2025-03-04 06:57:51,054 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2025-03-04 06:57:51,054 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 515 flow [2025-03-04 06:57:51,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:51,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:51,055 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] [2025-03-04 06:57:51,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:57:51,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:51,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1548332964, now seen corresponding path program 1 times [2025-03-04 06:57:51,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:51,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839801308] [2025-03-04 06:57:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:51,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 06:57:51,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 06:57:51,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:51,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839801308] [2025-03-04 06:57:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839801308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:51,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451872810] [2025-03-04 06:57:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:51,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:51,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:51,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:51,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 88 [2025-03-04 06:57:51,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:51,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:51,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 88 [2025-03-04 06:57:51,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:51,579 INFO L124 PetriNetUnfolderBase]: 140/585 cut-off events. [2025-03-04 06:57:51,579 INFO L125 PetriNetUnfolderBase]: For 340/365 co-relation queries the response was YES. [2025-03-04 06:57:51,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 585 events. 140/585 cut-off events. For 340/365 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3035 event pairs, 14 based on Foata normal form. 4/562 useless extension candidates. Maximal degree in co-relation 1382. Up to 232 conditions per place. [2025-03-04 06:57:51,583 INFO L140 encePairwiseOnDemand]: 74/88 looper letters, 46 selfloop transitions, 57 changer transitions 8/176 dead transitions. [2025-03-04 06:57:51,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 963 flow [2025-03-04 06:57:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2025-03-04 06:57:51,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977272727272727 [2025-03-04 06:57:51,586 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 515 flow. Second operand 6 states and 474 transitions. [2025-03-04 06:57:51,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 963 flow [2025-03-04 06:57:51,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 176 transitions, 925 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:51,598 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 981 flow [2025-03-04 06:57:51,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=119, PETRI_TRANSITIONS=168} [2025-03-04 06:57:51,599 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 30 predicate places. [2025-03-04 06:57:51,599 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 981 flow [2025-03-04 06:57:51,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:51,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:51,599 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] [2025-03-04 06:57:51,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:57:51,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:51,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -74011974, now seen corresponding path program 1 times [2025-03-04 06:57:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:51,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653585032] [2025-03-04 06:57:51,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:51,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:57:51,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:57:51,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:51,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:51,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653585032] [2025-03-04 06:57:51,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653585032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:51,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:51,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608751534] [2025-03-04 06:57:51,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:51,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:51,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:51,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:51,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:52,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2025-03-04 06:57:52,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:52,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:52,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2025-03-04 06:57:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:52,103 INFO L124 PetriNetUnfolderBase]: 125/536 cut-off events. [2025-03-04 06:57:52,103 INFO L125 PetriNetUnfolderBase]: For 639/656 co-relation queries the response was YES. [2025-03-04 06:57:52,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 536 events. 125/536 cut-off events. For 639/656 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2794 event pairs, 6 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 1501. Up to 135 conditions per place. [2025-03-04 06:57:52,107 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 55 selfloop transitions, 0 changer transitions 15/167 dead transitions. [2025-03-04 06:57:52,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 1105 flow [2025-03-04 06:57:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 410 transitions. [2025-03-04 06:57:52,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7765151515151515 [2025-03-04 06:57:52,111 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 981 flow. Second operand 6 states and 410 transitions. [2025-03-04 06:57:52,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 1105 flow [2025-03-04 06:57:52,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 1069 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:52,120 INFO L231 Difference]: Finished difference. Result has 115 places, 152 transitions, 908 flow [2025-03-04 06:57:52,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=115, PETRI_TRANSITIONS=152} [2025-03-04 06:57:52,121 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-03-04 06:57:52,121 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 152 transitions, 908 flow [2025-03-04 06:57:52,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:52,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:52,123 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:52,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:57:52,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:52,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash -51073103, now seen corresponding path program 1 times [2025-03-04 06:57:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-03-04 06:57:52,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:52,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:57:52,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:57:52,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:52,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:52,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-03-04 06:57:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403463320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:52,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:57:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645643307] [2025-03-04 06:57:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:52,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:57:52,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:52,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:57:52,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:57:53,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 88 [2025-03-04 06:57:53,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 152 transitions, 908 flow. Second operand has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:53,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:53,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 88 [2025-03-04 06:57:53,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:53,940 INFO L124 PetriNetUnfolderBase]: 186/656 cut-off events. [2025-03-04 06:57:53,940 INFO L125 PetriNetUnfolderBase]: For 784/799 co-relation queries the response was YES. [2025-03-04 06:57:53,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 656 events. 186/656 cut-off events. For 784/799 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3353 event pairs, 9 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 2164. Up to 286 conditions per place. [2025-03-04 06:57:53,948 INFO L140 encePairwiseOnDemand]: 70/88 looper letters, 114 selfloop transitions, 46 changer transitions 0/200 dead transitions. [2025-03-04 06:57:53,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 200 transitions, 1524 flow [2025-03-04 06:57:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 06:57:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 06:57:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 861 transitions. [2025-03-04 06:57:53,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6988636363636364 [2025-03-04 06:57:53,950 INFO L175 Difference]: Start difference. First operand has 115 places, 152 transitions, 908 flow. Second operand 14 states and 861 transitions. [2025-03-04 06:57:53,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 200 transitions, 1524 flow [2025-03-04 06:57:53,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 200 transitions, 1522 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:53,962 INFO L231 Difference]: Finished difference. Result has 117 places, 167 transitions, 1203 flow [2025-03-04 06:57:53,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1203, PETRI_PLACES=117, PETRI_TRANSITIONS=167} [2025-03-04 06:57:53,964 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 28 predicate places. [2025-03-04 06:57:53,964 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 167 transitions, 1203 flow [2025-03-04 06:57:53,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:53,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:53,965 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:53,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:57:53,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:53,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash -640876453, now seen corresponding path program 1 times [2025-03-04 06:57:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:53,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332955174] [2025-03-04 06:57:53,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:53,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:53,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:57:53,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:57:53,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:53,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:54,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:54,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332955174] [2025-03-04 06:57:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332955174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:54,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:54,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:57:54,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051039692] [2025-03-04 06:57:54,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:54,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:57:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:54,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:57:54,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:57:55,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2025-03-04 06:57:55,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 167 transitions, 1203 flow. Second operand has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:55,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:55,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2025-03-04 06:57:55,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:55,366 INFO L124 PetriNetUnfolderBase]: 193/700 cut-off events. [2025-03-04 06:57:55,366 INFO L125 PetriNetUnfolderBase]: For 1243/1274 co-relation queries the response was YES. [2025-03-04 06:57:55,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2593 conditions, 700 events. 193/700 cut-off events. For 1243/1274 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3715 event pairs, 12 based on Foata normal form. 4/703 useless extension candidates. Maximal degree in co-relation 2565. Up to 354 conditions per place. [2025-03-04 06:57:55,370 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 130 selfloop transitions, 37 changer transitions 0/212 dead transitions. [2025-03-04 06:57:55,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 212 transitions, 1845 flow [2025-03-04 06:57:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 06:57:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 06:57:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 911 transitions. [2025-03-04 06:57:55,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.739448051948052 [2025-03-04 06:57:55,373 INFO L175 Difference]: Start difference. First operand has 117 places, 167 transitions, 1203 flow. Second operand 14 states and 911 transitions. [2025-03-04 06:57:55,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 212 transitions, 1845 flow [2025-03-04 06:57:55,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 212 transitions, 1807 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:55,383 INFO L231 Difference]: Finished difference. Result has 136 places, 195 transitions, 1567 flow [2025-03-04 06:57:55,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1567, PETRI_PLACES=136, PETRI_TRANSITIONS=195} [2025-03-04 06:57:55,384 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 47 predicate places. [2025-03-04 06:57:55,384 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 195 transitions, 1567 flow [2025-03-04 06:57:55,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:55,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:55,385 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:55,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:57:55,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:55,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 17282619, now seen corresponding path program 2 times [2025-03-04 06:57:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339903538] [2025-03-04 06:57:55,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:57:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:55,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:57:55,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:57:55,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:57:55,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:55,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339903538] [2025-03-04 06:57:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339903538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:57:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264643811] [2025-03-04 06:57:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:57:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:55,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:57:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:57:56,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 88 [2025-03-04 06:57:56,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 195 transitions, 1567 flow. Second operand has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:56,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:56,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 88 [2025-03-04 06:57:56,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:56,917 INFO L124 PetriNetUnfolderBase]: 214/791 cut-off events. [2025-03-04 06:57:56,917 INFO L125 PetriNetUnfolderBase]: For 2181/2216 co-relation queries the response was YES. [2025-03-04 06:57:56,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 791 events. 214/791 cut-off events. For 2181/2216 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4468 event pairs, 9 based on Foata normal form. 6/795 useless extension candidates. Maximal degree in co-relation 3198. Up to 350 conditions per place. [2025-03-04 06:57:56,923 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 137 selfloop transitions, 77 changer transitions 0/263 dead transitions. [2025-03-04 06:57:56,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 263 transitions, 2641 flow [2025-03-04 06:57:56,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 06:57:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 06:57:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1435 transitions. [2025-03-04 06:57:56,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412190082644629 [2025-03-04 06:57:56,926 INFO L175 Difference]: Start difference. First operand has 136 places, 195 transitions, 1567 flow. Second operand 22 states and 1435 transitions. [2025-03-04 06:57:56,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 263 transitions, 2641 flow [2025-03-04 06:57:56,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 263 transitions, 2589 flow, removed 25 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:56,945 INFO L231 Difference]: Finished difference. Result has 168 places, 247 transitions, 2323 flow [2025-03-04 06:57:56,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2323, PETRI_PLACES=168, PETRI_TRANSITIONS=247} [2025-03-04 06:57:56,945 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 79 predicate places. [2025-03-04 06:57:56,945 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 247 transitions, 2323 flow [2025-03-04 06:57:56,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:56,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:56,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:57:56,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:57:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1344097717, now seen corresponding path program 3 times [2025-03-04 06:57:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571325108] [2025-03-04 06:57:56,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:57:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:56,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-03-04 06:57:56,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:57:56,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 06:57:56,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:57,459 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-04 06:57:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571325108] [2025-03-04 06:57:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571325108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:57:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8880515] [2025-03-04 06:57:57,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:57:57,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:57:57,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:57,463 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-04 06:57:57,467 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-04 06:57:57,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-03-04 06:57:57,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:57:57,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 06:57:57,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:57,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 06:57:57,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:57:57,810 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 11 treesize of output 7 [2025-03-04 06:57:57,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 06:57:57,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:57:57,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:57:58,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:57:58,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:57:58,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2025-03-04 06:57:58,130 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-04 06:57:58,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:58:10,056 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-04 06:58:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8880515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:58:10,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:58:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 11] total 35 [2025-03-04 06:58:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863682879] [2025-03-04 06:58:10,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:58:10,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 06:58:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:10,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 06:58:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1090, Unknown=4, NotChecked=0, Total=1260 [2025-03-04 06:58:13,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:15,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:17,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:18,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:22,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:26,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:30,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:31,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:35,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:39,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:44,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:47,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:58:48,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 88 [2025-03-04 06:58:48,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 247 transitions, 2323 flow. Second operand has 36 states, 36 states have (on average 50.22222222222222) internal successors, (1808), 36 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:48,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:48,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 88 [2025-03-04 06:58:48,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:50,450 INFO L124 PetriNetUnfolderBase]: 434/1547 cut-off events. [2025-03-04 06:58:50,450 INFO L125 PetriNetUnfolderBase]: For 5680/5780 co-relation queries the response was YES. [2025-03-04 06:58:50,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6853 conditions, 1547 events. 434/1547 cut-off events. For 5680/5780 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 10941 event pairs, 31 based on Foata normal form. 20/1565 useless extension candidates. Maximal degree in co-relation 6804. Up to 393 conditions per place. [2025-03-04 06:58:50,462 INFO L140 encePairwiseOnDemand]: 62/88 looper letters, 272 selfloop transitions, 125 changer transitions 0/435 dead transitions. [2025-03-04 06:58:50,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 435 transitions, 5115 flow [2025-03-04 06:58:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:58:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:58:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1583 transitions. [2025-03-04 06:58:50,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5996212121212121 [2025-03-04 06:58:50,468 INFO L175 Difference]: Start difference. First operand has 168 places, 247 transitions, 2323 flow. Second operand 30 states and 1583 transitions. [2025-03-04 06:58:50,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 435 transitions, 5115 flow [2025-03-04 06:58:50,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 435 transitions, 5007 flow, removed 43 selfloop flow, removed 4 redundant places. [2025-03-04 06:58:50,508 INFO L231 Difference]: Finished difference. Result has 209 places, 310 transitions, 3573 flow [2025-03-04 06:58:50,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3573, PETRI_PLACES=209, PETRI_TRANSITIONS=310} [2025-03-04 06:58:50,509 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 120 predicate places. [2025-03-04 06:58:50,510 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 310 transitions, 3573 flow [2025-03-04 06:58:50,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 50.22222222222222) internal successors, (1808), 36 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:50,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:50,511 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:50,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:58:50,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:58:50,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-04 06:58:50,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash -936371619, now seen corresponding path program 4 times [2025-03-04 06:58:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:50,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12775077] [2025-03-04 06:58:50,716 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:58:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:50,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-04 06:58:50,734 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-03-04 06:58:50,734 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:58:50,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:51,183 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-04 06:58:51,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12775077] [2025-03-04 06:58:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12775077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:58:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542128414] [2025-03-04 06:58:51,183 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:58:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:58:51,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:58:51,186 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-04 06:58:51,187 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-04 06:58:51,237 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-04 06:58:51,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-03-04 06:58:51,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:58:51,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:51,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 06:58:51,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:58:51,306 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 11 treesize of output 7 [2025-03-04 06:58:51,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 06:58:51,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:58:51,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 06:58:51,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:58:51,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 06:58:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:58:51,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:58:51,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:58:51,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 06:58:51,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:58:51,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2025-03-04 06:58:51,536 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-04 06:58:51,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:58:55,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post11#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store |c_#race| |ULTIMATE.start_main_~is~0#1.base| (store (select |c_#race| |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store |c_#race| |ULTIMATE.start_main_~is~0#1.base| (store (select |c_#race| |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store |c_#race| |ULTIMATE.start_main_~is~0#1.base| (store (select |c_#race| |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store |c_#race| |ULTIMATE.start_main_~is~0#1.base| (store (select |c_#race| |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2025-03-04 06:58:59,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post11#1| 1)) (.cse1 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0))))))) is different from false