./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.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 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:16,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:16,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:16,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:16,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:16,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:16,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:16,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:16,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:16,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:16,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:16,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:16,288 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:16,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:16,289 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:16,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:16,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:16,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:16,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:16,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:16,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:16,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:16,293 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 -> 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde [2025-04-30 10:26:16,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:16,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:16,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:16,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:16,514 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:16,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.i [2025-04-30 10:26:17,776 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcc142e5/76e16c11d202441e92c5fc45ebcf4cd0/FLAGe6a207cf6 [2025-04-30 10:26:18,022 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:18,023 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.i [2025-04-30 10:26:18,041 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcc142e5/76e16c11d202441e92c5fc45ebcf4cd0/FLAGe6a207cf6 [2025-04-30 10:26:18,778 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcc142e5/76e16c11d202441e92c5fc45ebcf4cd0 [2025-04-30 10:26:18,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:18,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:18,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:18,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:18,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:18,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:18" (1/1) ... [2025-04-30 10:26:18,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460c9bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:18, skipping insertion in model container [2025-04-30 10:26:18,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:18" (1/1) ... [2025-04-30 10:26:18,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:19,142 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:19,151 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:19,202 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:19,245 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:19,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19 WrapperNode [2025-04-30 10:26:19,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:19,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:19,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:19,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:19,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,284 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2025-04-30 10:26:19,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:19,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:19,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:19,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:19,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:19,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:19,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:19,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:19,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (1/1) ... [2025-04-30 10:26:19,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:19,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:19,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:26:19,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:26:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-04-30 10:26:19,364 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-04-30 10:26:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:26:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:19,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:19,365 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:19,485 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:19,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:19,632 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:19,632 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:19,654 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:19,654 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:19,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:19 BoogieIcfgContainer [2025-04-30 10:26:19,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:19,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:19,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:19,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:19,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:18" (1/3) ... [2025-04-30 10:26:19,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c67fbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:19, skipping insertion in model container [2025-04-30 10:26:19,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:19" (2/3) ... [2025-04-30 10:26:19,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c67fbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:19, skipping insertion in model container [2025-04-30 10:26:19,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:19" (3/3) ... [2025-04-30 10:26:19,664 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_44-malloc_sound.i [2025-04-30 10:26:19,676 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:19,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_44-malloc_sound.i that has 2 procedures, 89 locations, 90 edges, 1 initial locations, 1 loop locations, and 10 error locations. [2025-04-30 10:26:19,678 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:19,729 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:19,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 91 transitions, 186 flow [2025-04-30 10:26:19,790 INFO L116 PetriNetUnfolderBase]: 3/90 cut-off events. [2025-04-30 10:26:19,794 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:19,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 90 events. 3/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 162 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-04-30 10:26:19,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 91 transitions, 186 flow [2025-04-30 10:26:19,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 90 transitions, 183 flow [2025-04-30 10:26:19,806 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:19,819 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@302ede1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:19,819 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-30 10:26:19,828 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:19,830 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-30 10:26:19,830 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:19,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:19,831 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] [2025-04-30 10:26:19,831 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:19,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1641359930, now seen corresponding path program 1 times [2025-04-30 10:26:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:19,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053592823] [2025-04-30 10:26:19,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:19,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:26:19,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:26:19,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:19,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:20,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053592823] [2025-04-30 10:26:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053592823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:20,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:20,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91739478] [2025-04-30 10:26:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:20,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:20,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:20,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:20,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-30 10:26:20,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:20,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:20,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-30 10:26:20,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:20,138 INFO L116 PetriNetUnfolderBase]: 9/165 cut-off events. [2025-04-30 10:26:20,138 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:20,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 165 events. 9/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 385 event pairs, 6 based on Foata normal form. 3/148 useless extension candidates. Maximal degree in co-relation 134. Up to 26 conditions per place. [2025-04-30 10:26:20,141 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 12 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-04-30 10:26:20,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 213 flow [2025-04-30 10:26:20,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-04-30 10:26:20,151 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-04-30 10:26:20,152 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 183 flow. Second operand 3 states and 251 transitions. [2025-04-30 10:26:20,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 213 flow [2025-04-30 10:26:20,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:20,160 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 198 flow [2025-04-30 10:26:20,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2025-04-30 10:26:20,167 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-04-30 10:26:20,168 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 198 flow [2025-04-30 10:26:20,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:20,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:20,169 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] [2025-04-30 10:26:20,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:20,169 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:20,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -504491126, now seen corresponding path program 1 times [2025-04-30 10:26:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:20,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326028368] [2025-04-30 10:26:20,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:20,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:26:20,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:26:20,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:20,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:20,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:20,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326028368] [2025-04-30 10:26:20,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326028368] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:20,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889145423] [2025-04-30 10:26:20,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:20,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:20,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:20,331 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-04-30 10:26:20,332 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-04-30 10:26:20,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:26:20,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:26:20,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:20,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:20,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:26:20,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:26:20,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889145423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-30 10:26:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197072477] [2025-04-30 10:26:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:20,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:20,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:20,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:20,420 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-04-30 10:26:20,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:20,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:20,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-04-30 10:26:20,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:20,469 INFO L116 PetriNetUnfolderBase]: 15/151 cut-off events. [2025-04-30 10:26:20,469 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:20,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 151 events. 15/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 417 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 170. Up to 30 conditions per place. [2025-04-30 10:26:20,470 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2025-04-30 10:26:20,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 222 flow [2025-04-30 10:26:20,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-04-30 10:26:20,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-04-30 10:26:20,472 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 198 flow. Second operand 3 states and 251 transitions. [2025-04-30 10:26:20,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 222 flow [2025-04-30 10:26:20,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:20,474 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 194 flow [2025-04-30 10:26:20,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-04-30 10:26:20,475 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-04-30 10:26:20,475 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 194 flow [2025-04-30 10:26:20,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:20,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:20,476 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-04-30 10:26:20,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:26:20,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:20,677 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:20,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1538839136, now seen corresponding path program 1 times [2025-04-30 10:26:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:20,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220530961] [2025-04-30 10:26:20,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:20,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:26:20,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:26:20,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:20,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:20,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220530961] [2025-04-30 10:26:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220530961] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:20,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586464885] [2025-04-30 10:26:20,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:20,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:20,785 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-04-30 10:26:20,791 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-04-30 10:26:20,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:26:20,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:26:20,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:20,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:20,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:26:20,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:26:20,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:20,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586464885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:20,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:20,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-30 10:26:20,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105234323] [2025-04-30 10:26:20,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:20,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:20,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:20,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:20,872 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-04-30 10:26:20,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:20,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:20,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-04-30 10:26:20,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:20,904 INFO L116 PetriNetUnfolderBase]: 15/153 cut-off events. [2025-04-30 10:26:20,904 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:20,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 153 events. 15/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 419 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 145. Up to 30 conditions per place. [2025-04-30 10:26:20,906 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-04-30 10:26:20,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 218 flow [2025-04-30 10:26:20,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-04-30 10:26:20,908 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-04-30 10:26:20,908 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 194 flow. Second operand 3 states and 251 transitions. [2025-04-30 10:26:20,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 218 flow [2025-04-30 10:26:20,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:20,910 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 191 flow [2025-04-30 10:26:20,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-04-30 10:26:20,911 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2025-04-30 10:26:20,911 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 191 flow [2025-04-30 10:26:20,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:20,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:20,911 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:26:20,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:21,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-30 10:26:21,112 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:21,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -775990810, now seen corresponding path program 1 times [2025-04-30 10:26:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:21,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981848356] [2025-04-30 10:26:21,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:21,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:26:21,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:26:21,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:21,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:21,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981848356] [2025-04-30 10:26:21,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981848356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:21,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359816279] [2025-04-30 10:26:21,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:21,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:26:21,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:26:21,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:26:21,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:21,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:21,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:26:21,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:26:21,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359816279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-30 10:26:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25691649] [2025-04-30 10:26:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:21,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:21,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:21,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:21,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-30 10:26:21,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:21,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:21,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-30 10:26:21,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:21,306 INFO L116 PetriNetUnfolderBase]: 18/201 cut-off events. [2025-04-30 10:26:21,306 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:26:21,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 201 events. 18/201 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 672 event pairs, 10 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 146. Up to 35 conditions per place. [2025-04-30 10:26:21,307 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 14 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-04-30 10:26:21,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 91 transitions, 237 flow [2025-04-30 10:26:21,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-04-30 10:26:21,308 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-04-30 10:26:21,308 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 191 flow. Second operand 3 states and 252 transitions. [2025-04-30 10:26:21,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 91 transitions, 237 flow [2025-04-30 10:26:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:21,309 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 206 flow [2025-04-30 10:26:21,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-04-30 10:26:21,310 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-04-30 10:26:21,310 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 206 flow [2025-04-30 10:26:21,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:21,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:21,310 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:26:21,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:21,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:21,515 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:21,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1683151289, now seen corresponding path program 1 times [2025-04-30 10:26:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:21,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914285077] [2025-04-30 10:26:21,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:21,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:26:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:26:21,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:21,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:21,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914285077] [2025-04-30 10:26:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914285077] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:21,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061960506] [2025-04-30 10:26:21,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:21,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:21,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:21,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:21,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:26:21,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:26:21,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:26:21,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:21,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:21,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:26:21,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:26:21,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061960506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-30 10:26:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613143592] [2025-04-30 10:26:21,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:21,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:21,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:21,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:21,656 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-30 10:26:21,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:21,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:21,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-30 10:26:21,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:21,685 INFO L116 PetriNetUnfolderBase]: 28/293 cut-off events. [2025-04-30 10:26:21,685 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:21,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 293 events. 28/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1213 event pairs, 13 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 286. Up to 48 conditions per place. [2025-04-30 10:26:21,686 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 14 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-04-30 10:26:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 255 flow [2025-04-30 10:26:21,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-04-30 10:26:21,687 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9267399267399268 [2025-04-30 10:26:21,687 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 206 flow. Second operand 3 states and 253 transitions. [2025-04-30 10:26:21,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 255 flow [2025-04-30 10:26:21,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:21,689 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 226 flow [2025-04-30 10:26:21,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-04-30 10:26:21,690 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-04-30 10:26:21,690 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 226 flow [2025-04-30 10:26:21,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:21,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:21,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:21,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:21,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:21,891 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:21,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1320673165, now seen corresponding path program 1 times [2025-04-30 10:26:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:21,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995736496] [2025-04-30 10:26:21,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:21,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:26:21,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:26:21,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:21,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:21,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995736496] [2025-04-30 10:26:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995736496] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:21,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240729973] [2025-04-30 10:26:21,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:21,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:21,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:21,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:21,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:26:21,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:26:21,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:26:21,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:21,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:21,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:26:21,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:26:21,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240729973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-30 10:26:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884851948] [2025-04-30 10:26:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:21,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:21,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:21,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:22,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-30 10:26:22,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:22,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-30 10:26:22,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:22,050 INFO L116 PetriNetUnfolderBase]: 46/395 cut-off events. [2025-04-30 10:26:22,050 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:22,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 395 events. 46/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2025 event pairs, 15 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 440. Up to 56 conditions per place. [2025-04-30 10:26:22,052 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 17 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-04-30 10:26:22,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 292 flow [2025-04-30 10:26:22,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-04-30 10:26:22,053 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-04-30 10:26:22,053 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 226 flow. Second operand 3 states and 259 transitions. [2025-04-30 10:26:22,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 292 flow [2025-04-30 10:26:22,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:22,055 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 274 flow [2025-04-30 10:26:22,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-04-30 10:26:22,056 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-04-30 10:26:22,056 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 274 flow [2025-04-30 10:26:22,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:22,056 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-04-30 10:26:22,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:26:22,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:22,257 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:22,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:22,257 INFO L85 PathProgramCache]: Analyzing trace with hash -752803953, now seen corresponding path program 1 times [2025-04-30 10:26:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:22,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874840519] [2025-04-30 10:26:22,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:22,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:22,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:26:22,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:26:22,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:22,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:22,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:22,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874840519] [2025-04-30 10:26:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874840519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:22,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062679886] [2025-04-30 10:26:22,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:22,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:22,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:22,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:26:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:26:22,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:26:22,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:22,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:22,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:26:22,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:26:22,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062679886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-30 10:26:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139701142] [2025-04-30 10:26:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:22,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:22,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:22,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:22,387 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-30 10:26:22,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:22,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-30 10:26:22,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:22,440 INFO L116 PetriNetUnfolderBase]: 61/460 cut-off events. [2025-04-30 10:26:22,440 INFO L117 PetriNetUnfolderBase]: For 103/108 co-relation queries the response was YES. [2025-04-30 10:26:22,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 460 events. 61/460 cut-off events. For 103/108 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2567 event pairs, 23 based on Foata normal form. 3/443 useless extension candidates. Maximal degree in co-relation 524. Up to 103 conditions per place. [2025-04-30 10:26:22,442 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 16 selfloop transitions, 7 changer transitions 2/103 dead transitions. [2025-04-30 10:26:22,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 103 transitions, 346 flow [2025-04-30 10:26:22,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-04-30 10:26:22,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2025-04-30 10:26:22,443 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 274 flow. Second operand 3 states and 254 transitions. [2025-04-30 10:26:22,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 103 transitions, 346 flow [2025-04-30 10:26:22,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 103 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:22,448 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 314 flow [2025-04-30 10:26:22,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-04-30 10:26:22,449 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 7 predicate places. [2025-04-30 10:26:22,449 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 314 flow [2025-04-30 10:26:22,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:22,450 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] [2025-04-30 10:26:22,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:22,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:22,651 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:22,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -135110132, now seen corresponding path program 1 times [2025-04-30 10:26:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:22,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309848981] [2025-04-30 10:26:22,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:22,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:26:22,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:26:22,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:22,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:22,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309848981] [2025-04-30 10:26:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309848981] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:22,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123697432] [2025-04-30 10:26:22,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:22,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:22,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:22,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:22,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:26:22,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:26:22,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:26:22,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:22,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:22,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:26:22,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:26:22,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123697432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:22,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:22,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-30 10:26:22,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992768419] [2025-04-30 10:26:22,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:22,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:22,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:22,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:22,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-30 10:26:22,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:22,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-30 10:26:22,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:22,833 INFO L116 PetriNetUnfolderBase]: 79/520 cut-off events. [2025-04-30 10:26:22,834 INFO L117 PetriNetUnfolderBase]: For 225/232 co-relation queries the response was YES. [2025-04-30 10:26:22,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 520 events. 79/520 cut-off events. For 225/232 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3020 event pairs, 27 based on Foata normal form. 2/504 useless extension candidates. Maximal degree in co-relation 718. Up to 128 conditions per place. [2025-04-30 10:26:22,835 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 17 selfloop transitions, 7 changer transitions 7/107 dead transitions. [2025-04-30 10:26:22,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 400 flow [2025-04-30 10:26:22,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-04-30 10:26:22,837 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2025-04-30 10:26:22,837 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 314 flow. Second operand 3 states and 250 transitions. [2025-04-30 10:26:22,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 400 flow [2025-04-30 10:26:22,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:22,840 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 332 flow [2025-04-30 10:26:22,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2025-04-30 10:26:22,841 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-04-30 10:26:22,841 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 332 flow [2025-04-30 10:26:22,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:22,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:22,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:26:23,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:23,042 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:23,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1429171180, now seen corresponding path program 1 times [2025-04-30 10:26:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:23,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901815591] [2025-04-30 10:26:23,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:23,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:23,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:26:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:26:23,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:23,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:23,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901815591] [2025-04-30 10:26:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901815591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:23,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809726168] [2025-04-30 10:26:23,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:23,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:23,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:23,102 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:23,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:26:23,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:26:23,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:26:23,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:23,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:23,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:26:23,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:23,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809726168] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:23,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:26:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997236591] [2025-04-30 10:26:23,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:23,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:23,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:23,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:23,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:23,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-04-30 10:26:23,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:23,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-04-30 10:26:23,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:23,397 INFO L116 PetriNetUnfolderBase]: 40/464 cut-off events. [2025-04-30 10:26:23,397 INFO L117 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-04-30 10:26:23,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 464 events. 40/464 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2367 event pairs, 12 based on Foata normal form. 7/459 useless extension candidates. Maximal degree in co-relation 508. Up to 54 conditions per place. [2025-04-30 10:26:23,398 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2025-04-30 10:26:23,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 416 flow [2025-04-30 10:26:23,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:26:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:26:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 857 transitions. [2025-04-30 10:26:23,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8561438561438561 [2025-04-30 10:26:23,400 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 332 flow. Second operand 11 states and 857 transitions. [2025-04-30 10:26:23,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 416 flow [2025-04-30 10:26:23,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 110 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:23,403 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 392 flow [2025-04-30 10:26:23,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-04-30 10:26:23,404 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 20 predicate places. [2025-04-30 10:26:23,404 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 392 flow [2025-04-30 10:26:23,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:23,404 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:23,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:26:23,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-30 10:26:23,609 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:23,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -999059986, now seen corresponding path program 2 times [2025-04-30 10:26:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:23,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657112378] [2025-04-30 10:26:23,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:23,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-30 10:26:23,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 66 statements. [2025-04-30 10:26:23,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-30 10:26:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:23,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657112378] [2025-04-30 10:26:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657112378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54456397] [2025-04-30 10:26:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:23,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:26:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:23,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:26:23,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:26:23,709 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 91 [2025-04-30 10:26:23,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:23,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 91 [2025-04-30 10:26:23,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:23,815 INFO L116 PetriNetUnfolderBase]: 57/800 cut-off events. [2025-04-30 10:26:23,816 INFO L117 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-04-30 10:26:23,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 800 events. 57/800 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5356 event pairs, 15 based on Foata normal form. 2/782 useless extension candidates. Maximal degree in co-relation 490. Up to 74 conditions per place. [2025-04-30 10:26:23,818 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 13 selfloop transitions, 11 changer transitions 8/130 dead transitions. [2025-04-30 10:26:23,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 504 flow [2025-04-30 10:26:23,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:26:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:26:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 601 transitions. [2025-04-30 10:26:23,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9434850863422292 [2025-04-30 10:26:23,820 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 392 flow. Second operand 7 states and 601 transitions. [2025-04-30 10:26:23,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 504 flow [2025-04-30 10:26:23,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 492 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:23,823 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 429 flow [2025-04-30 10:26:23,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2025-04-30 10:26:23,823 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 27 predicate places. [2025-04-30 10:26:23,823 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 429 flow [2025-04-30 10:26:23,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:23,824 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:23,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:26:23,824 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:23,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1079890278, now seen corresponding path program 1 times [2025-04-30 10:26:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:23,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058416867] [2025-04-30 10:26:23,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:23,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:26:23,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:26:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:26:23,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:23,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058416867] [2025-04-30 10:26:23,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058416867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:23,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615614259] [2025-04-30 10:26:23,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:23,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:23,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:23,937 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:23,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:26:23,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:26:24,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:26:24,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:24,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:24,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:26:24,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:26:24,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:26:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615614259] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:24,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-30 10:26:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319301852] [2025-04-30 10:26:24,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:24,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:26:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:24,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:26:24,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:26:24,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-30 10:26:24,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 429 flow. Second operand has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:24,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:24,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-30 10:26:24,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:24,322 INFO L116 PetriNetUnfolderBase]: 58/761 cut-off events. [2025-04-30 10:26:24,322 INFO L117 PetriNetUnfolderBase]: For 311/317 co-relation queries the response was YES. [2025-04-30 10:26:24,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 761 events. 58/761 cut-off events. For 311/317 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4464 event pairs, 14 based on Foata normal form. 14/756 useless extension candidates. Maximal degree in co-relation 594. Up to 94 conditions per place. [2025-04-30 10:26:24,324 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 21 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2025-04-30 10:26:24,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 569 flow [2025-04-30 10:26:24,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:26:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:26:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2025-04-30 10:26:24,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.861021331609567 [2025-04-30 10:26:24,327 INFO L175 Difference]: Start difference. First operand has 118 places, 115 transitions, 429 flow. Second operand 17 states and 1332 transitions. [2025-04-30 10:26:24,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 569 flow [2025-04-30 10:26:24,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 567 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:24,330 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 560 flow [2025-04-30 10:26:24,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=560, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2025-04-30 10:26:24,331 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 46 predicate places. [2025-04-30 10:26:24,331 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 560 flow [2025-04-30 10:26:24,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:24,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:24,332 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:24,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:26:24,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:24,533 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:24,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1817159862, now seen corresponding path program 1 times [2025-04-30 10:26:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:24,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736126810] [2025-04-30 10:26:24,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:24,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-30 10:26:24,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-30 10:26:24,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:24,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-30 10:26:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:24,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736126810] [2025-04-30 10:26:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736126810] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:24,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652134269] [2025-04-30 10:26:24,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:24,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:24,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:24,658 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:24,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:26:24,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-30 10:26:24,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-30 10:26:24,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:24,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:24,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:26:24,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-30 10:26:24,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-30 10:26:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652134269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:24,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-04-30 10:26:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944086136] [2025-04-30 10:26:24,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:24,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:26:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:24,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:26:24,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:26:24,911 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2025-04-30 10:26:24,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:24,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:24,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2025-04-30 10:26:24,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:25,133 INFO L116 PetriNetUnfolderBase]: 64/772 cut-off events. [2025-04-30 10:26:25,133 INFO L117 PetriNetUnfolderBase]: For 551/557 co-relation queries the response was YES. [2025-04-30 10:26:25,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 772 events. 64/772 cut-off events. For 551/557 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3611 event pairs, 13 based on Foata normal form. 9/763 useless extension candidates. Maximal degree in co-relation 820. Up to 66 conditions per place. [2025-04-30 10:26:25,135 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 29 selfloop transitions, 45 changer transitions 1/158 dead transitions. [2025-04-30 10:26:25,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 158 transitions, 906 flow [2025-04-30 10:26:25,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:26:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:26:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1613 transitions. [2025-04-30 10:26:25,139 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8440607012035584 [2025-04-30 10:26:25,139 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 560 flow. Second operand 21 states and 1613 transitions. [2025-04-30 10:26:25,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 158 transitions, 906 flow [2025-04-30 10:26:25,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 888 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-30 10:26:25,146 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 823 flow [2025-04-30 10:26:25,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=823, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2025-04-30 10:26:25,146 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 65 predicate places. [2025-04-30 10:26:25,147 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 823 flow [2025-04-30 10:26:25,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:25,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:25,148 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:25,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:25,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:26:25,349 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:25,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -216749472, now seen corresponding path program 2 times [2025-04-30 10:26:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:25,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882913163] [2025-04-30 10:26:25,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:25,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-04-30 10:26:25,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-04-30 10:26:25,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:26:25,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:25,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882913163] [2025-04-30 10:26:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882913163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:25,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184436772] [2025-04-30 10:26:25,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:25,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:25,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:25,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:25,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:26:25,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-04-30 10:26:25,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-04-30 10:26:25,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:26:25,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:25,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:26:25,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:25,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:25,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184436772] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:25,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:25,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2025-04-30 10:26:25,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94659946] [2025-04-30 10:26:25,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:25,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:26:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:25,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:26:25,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:26:25,925 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-04-30 10:26:25,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 823 flow. Second operand has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:25,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:25,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-04-30 10:26:25,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:26,149 INFO L116 PetriNetUnfolderBase]: 37/455 cut-off events. [2025-04-30 10:26:26,150 INFO L117 PetriNetUnfolderBase]: For 500/502 co-relation queries the response was YES. [2025-04-30 10:26:26,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 455 events. 37/455 cut-off events. For 500/502 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1569 event pairs, 5 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 752. Up to 53 conditions per place. [2025-04-30 10:26:26,151 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 35 selfloop transitions, 34 changer transitions 0/153 dead transitions. [2025-04-30 10:26:26,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 153 transitions, 1011 flow [2025-04-30 10:26:26,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:26:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:26:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1623 transitions. [2025-04-30 10:26:26,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8492935635792779 [2025-04-30 10:26:26,155 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 823 flow. Second operand 21 states and 1623 transitions. [2025-04-30 10:26:26,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 153 transitions, 1011 flow [2025-04-30 10:26:26,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 153 transitions, 911 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-04-30 10:26:26,161 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 860 flow [2025-04-30 10:26:26,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=860, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2025-04-30 10:26:26,161 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 81 predicate places. [2025-04-30 10:26:26,161 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 860 flow [2025-04-30 10:26:26,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:26,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:26,162 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:26,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:26:26,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:26:26,363 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-30 10:26:26,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash -659801372, now seen corresponding path program 1 times [2025-04-30 10:26:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:26,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539126692] [2025-04-30 10:26:26,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:26,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-30 10:26:26,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-30 10:26:26,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:26,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:26:26,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-30 10:26:26,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-30 10:26:26,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:26,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:26,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:26:26,436 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:26:26,437 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-30 10:26:26,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-30 10:26:26,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-30 10:26:26,438 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-30 10:26:26,439 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-30 10:26:26,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:26:26,440 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:26,522 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:26,522 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:26,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:26 BasicIcfg [2025-04-30 10:26:26,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:26,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:26,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:26,526 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:26,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:19" (3/4) ... [2025-04-30 10:26:26,527 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:26:26,605 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-04-30 10:26:26,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:26,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:26,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:26,660 INFO L158 Benchmark]: Toolchain (without parser) took 7879.08ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 121.5MB in the beginning and 155.4MB in the end (delta: -33.9MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:26,660 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:26,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.19ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 91.4MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:26:26,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:26,661 INFO L158 Benchmark]: Boogie Preprocessor took 24.92ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 87.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:26,661 INFO L158 Benchmark]: RCFGBuilder took 343.85ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 73.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:26,662 INFO L158 Benchmark]: TraceAbstraction took 6866.98ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 72.4MB in the beginning and 172.2MB in the end (delta: -99.8MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2025-04-30 10:26:26,662 INFO L158 Benchmark]: Witness Printer took 133.73ms. Allocated memory is still 394.3MB. Free memory was 172.2MB in the beginning and 155.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:26,663 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.19ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 91.4MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.92ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 87.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 343.85ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 73.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6866.98ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 72.4MB in the beginning and 172.2MB in the end (delta: -99.8MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. * Witness Printer took 133.73ms. Allocated memory is still 394.3MB. Free memory was 172.2MB in the beginning and 155.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1009]: Data race detected Data race detected The following path leads to a data race: [L987] 0 int glob; VAL [glob=0] [L988] 0 pthread_mutex_t *p, *q; VAL [glob=0, p={0:0}, q={0:0}] [L996] 0 pthread_t t1, t2; VAL [glob=0, p={0:0}, q={0:0}] [L997] 0 int i; VAL [glob=0, p={0:0}, q={0:0}] [L998] 0 pthread_mutex_t *a; VAL [glob=0, p={0:0}, q={0:0}] [L999] 0 i=0 VAL [glob=0, i=0, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-2:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-3:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-4:0}, glob=0, i=3, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1002] COND TRUE 0 i==3 VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1003] 0 p = a VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-5:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-6:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-7:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-8:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1004] COND TRUE 0 i==7 VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1005] 0 q = a VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-9:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-10:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}] [L999] COND FALSE 0 !(i < 10) VAL [glob=0, p={-5:0}, q={-9:0}] [L1007] FCALL, FORK 0 pthread_create(&t1, 0, f, 0) VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L1008] 0 pthread_mutex_lock(p) VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L990] 1 pthread_mutex_lock(q) VAL [\at(x, Pre)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L991] 1 glob++ VAL [\at(x, Pre)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] [L991] 1 glob++ VAL [\at(x, Pre)={0:0}, glob=1, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=1, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] Now there is a data race on ~glob~0 between C: glob++ [991] and C: glob++ [1009] - UnprovableResult [Line: 990]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 992]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 locations, 116 edges, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 881 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 102 mSDtfsCounter, 881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 903 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=13, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1574 ConstructedInterpolants, 0 QuantifiedInterpolants, 2823 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1596 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-30 10:26:26,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)