./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_04-munge_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/04-mutex_04-munge_nr.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 09d5acb2f81ee0994352651dad5f891cf0af6948836360f3240d2ea1a246e8a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:15:05,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:15:05,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:15:05,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:15:05,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:15:05,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:15:05,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:15:05,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:15:05,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:15:05,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:15:05,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:15:05,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:15:05,811 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:15:05,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:15:05,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:05,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:15:05,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:15:05,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:15:05,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:15:05,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:15:05,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:15:05,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:15:05,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:15:05,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:15:05,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:15:05,814 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 -> 09d5acb2f81ee0994352651dad5f891cf0af6948836360f3240d2ea1a246e8a6 [2025-03-13 22:15:06,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:15:06,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:15:06,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:15:06,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:15:06,042 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:15:06,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_04-munge_nr.i [2025-03-13 22:15:07,151 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cb9e625/a1012c413a3a4a35ab825c56201e530e/FLAG26e974291 [2025-03-13 22:15:07,426 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:15:07,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_04-munge_nr.i [2025-03-13 22:15:07,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cb9e625/a1012c413a3a4a35ab825c56201e530e/FLAG26e974291 [2025-03-13 22:15:07,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cb9e625/a1012c413a3a4a35ab825c56201e530e [2025-03-13 22:15:07,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:15:07,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:15:07,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:07,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:15:07,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:15:07,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:07" (1/1) ... [2025-03-13 22:15:07,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3800c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:07, skipping insertion in model container [2025-03-13 22:15:07,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:07" (1/1) ... [2025-03-13 22:15:07,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:15:08,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:08,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:15:08,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:08,151 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:15:08,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08 WrapperNode [2025-03-13 22:15:08,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:08,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:08,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:15:08,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:15:08,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,182 INFO L138 Inliner]: procedures = 263, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-03-13 22:15:08,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:08,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:15:08,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:15:08,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:15:08,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:15:08,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:15:08,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:15:08,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:15:08,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (1/1) ... [2025-03-13 22:15:08,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:08,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:15:08,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:15:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:15:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:15:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:15:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:15:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:15:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:15:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:15:08,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:15:08,252 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:15:08,334 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:15:08,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:15:08,449 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:15:08,450 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:15:08,450 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:15:08,464 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:15:08,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:08 BoogieIcfgContainer [2025-03-13 22:15:08,464 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:15:08,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:15:08,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:15:08,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:15:08,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:15:07" (1/3) ... [2025-03-13 22:15:08,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662d86f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:08, skipping insertion in model container [2025-03-13 22:15:08,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:08" (2/3) ... [2025-03-13 22:15:08,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662d86f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:08, skipping insertion in model container [2025-03-13 22:15:08,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:08" (3/3) ... [2025-03-13 22:15:08,471 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_04-munge_nr.i [2025-03-13 22:15:08,480 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:15:08,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_04-munge_nr.i that has 2 procedures, 65 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-13 22:15:08,482 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:15:08,526 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:15:08,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 64 transitions, 135 flow [2025-03-13 22:15:08,590 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2025-03-13 22:15:08,592 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:08,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 63 events. 0/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-13 22:15:08,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 64 transitions, 135 flow [2025-03-13 22:15:08,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 119 flow [2025-03-13 22:15:08,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:15:08,612 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c010d04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:15:08,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 22:15:08,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:15:08,621 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-13 22:15:08,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:08,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:08,621 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] [2025-03-13 22:15:08,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:08,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash -499809741, now seen corresponding path program 1 times [2025-03-13 22:15:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:08,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356599181] [2025-03-13 22:15:08,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:08,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:08,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:15:08,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:15:08,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:08,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356599181] [2025-03-13 22:15:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356599181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:08,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:15:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088884836] [2025-03-13 22:15:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:08,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:08,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:08,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:15:08,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 64 [2025-03-13 22:15:08,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:08,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:08,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 64 [2025-03-13 22:15:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:08,928 INFO L124 PetriNetUnfolderBase]: 31/195 cut-off events. [2025-03-13 22:15:08,928 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:08,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 195 events. 31/195 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 818 event pairs, 13 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 256. Up to 44 conditions per place. [2025-03-13 22:15:08,932 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 17 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2025-03-13 22:15:08,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 185 flow [2025-03-13 22:15:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-03-13 22:15:08,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114583333333334 [2025-03-13 22:15:08,944 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 119 flow. Second operand 3 states and 175 transitions. [2025-03-13 22:15:08,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 185 flow [2025-03-13 22:15:08,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 68 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:08,951 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 170 flow [2025-03-13 22:15:08,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2025-03-13 22:15:08,955 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-03-13 22:15:08,956 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 170 flow [2025-03-13 22:15:08,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:08,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:08,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:08,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:15:08,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:08,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash -357792971, now seen corresponding path program 1 times [2025-03-13 22:15:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-03-13 22:15:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:08,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:15:08,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:15:08,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:08,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:09,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-03-13 22:15:09,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881823587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:15:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402109786] [2025-03-13 22:15:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:09,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:09,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:09,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:15:09,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 64 [2025-03-13 22:15:09,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:09,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:09,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 64 [2025-03-13 22:15:09,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:09,108 INFO L124 PetriNetUnfolderBase]: 56/263 cut-off events. [2025-03-13 22:15:09,109 INFO L125 PetriNetUnfolderBase]: For 107/115 co-relation queries the response was YES. [2025-03-13 22:15:09,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 263 events. 56/263 cut-off events. For 107/115 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1279 event pairs, 30 based on Foata normal form. 4/251 useless extension candidates. Maximal degree in co-relation 476. Up to 108 conditions per place. [2025-03-13 22:15:09,113 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 18 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2025-03-13 22:15:09,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 246 flow [2025-03-13 22:15:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-13 22:15:09,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2025-03-13 22:15:09,115 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 170 flow. Second operand 3 states and 166 transitions. [2025-03-13 22:15:09,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 246 flow [2025-03-13 22:15:09,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:15:09,120 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 214 flow [2025-03-13 22:15:09,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2025-03-13 22:15:09,121 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-03-13 22:15:09,121 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 214 flow [2025-03-13 22:15:09,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:09,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:09,122 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-03-13 22:15:09,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:15:09,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2016322728, now seen corresponding path program 1 times [2025-03-13 22:15:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:09,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586708123] [2025-03-13 22:15:09,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:09,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:15:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:15:09,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:09,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:09,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586708123] [2025-03-13 22:15:09,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586708123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:09,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:09,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:15:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026201441] [2025-03-13 22:15:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:09,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:09,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:09,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:15:09,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 64 [2025-03-13 22:15:09,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:09,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:09,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 64 [2025-03-13 22:15:09,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:09,246 INFO L124 PetriNetUnfolderBase]: 69/302 cut-off events. [2025-03-13 22:15:09,246 INFO L125 PetriNetUnfolderBase]: For 223/230 co-relation queries the response was YES. [2025-03-13 22:15:09,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 302 events. 69/302 cut-off events. For 223/230 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1514 event pairs, 30 based on Foata normal form. 2/289 useless extension candidates. Maximal degree in co-relation 627. Up to 125 conditions per place. [2025-03-13 22:15:09,251 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 17 selfloop transitions, 7 changer transitions 7/76 dead transitions. [2025-03-13 22:15:09,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 300 flow [2025-03-13 22:15:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-13 22:15:09,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2025-03-13 22:15:09,253 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 214 flow. Second operand 3 states and 166 transitions. [2025-03-13 22:15:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 300 flow [2025-03-13 22:15:09,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:15:09,258 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 232 flow [2025-03-13 22:15:09,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2025-03-13 22:15:09,260 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-03-13 22:15:09,260 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 232 flow [2025-03-13 22:15:09,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:09,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:09,260 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] [2025-03-13 22:15:09,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:15:09,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:09,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash -220610154, now seen corresponding path program 1 times [2025-03-13 22:15:09,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:09,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973096259] [2025-03-13 22:15:09,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:09,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:09,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:09,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:09,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:09,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:09,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973096259] [2025-03-13 22:15:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973096259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:09,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679435860] [2025-03-13 22:15:09,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:09,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:09,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:09,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:09,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:09,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:09,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:09,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:09,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:09,753 INFO L124 PetriNetUnfolderBase]: 72/420 cut-off events. [2025-03-13 22:15:09,754 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-13 22:15:09,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 420 events. 72/420 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2429 event pairs, 10 based on Foata normal form. 1/412 useless extension candidates. Maximal degree in co-relation 835. Up to 54 conditions per place. [2025-03-13 22:15:09,757 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 17 selfloop transitions, 14 changer transitions 21/104 dead transitions. [2025-03-13 22:15:09,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 408 flow [2025-03-13 22:15:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 22:15:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 22:15:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 570 transitions. [2025-03-13 22:15:09,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8096590909090909 [2025-03-13 22:15:09,761 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 232 flow. Second operand 11 states and 570 transitions. [2025-03-13 22:15:09,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 408 flow [2025-03-13 22:15:09,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:15:09,766 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 264 flow [2025-03-13 22:15:09,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=264, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-03-13 22:15:09,767 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2025-03-13 22:15:09,767 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 264 flow [2025-03-13 22:15:09,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:09,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:09,767 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] [2025-03-13 22:15:09,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:15:09,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:09,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1867668650, now seen corresponding path program 2 times [2025-03-13 22:15:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:09,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191250657] [2025-03-13 22:15:09,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:09,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:09,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:09,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191250657] [2025-03-13 22:15:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191250657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530404274] [2025-03-13 22:15:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:09,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:09,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:09,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:09,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:09,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:09,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:09,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:09,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:10,131 INFO L124 PetriNetUnfolderBase]: 33/287 cut-off events. [2025-03-13 22:15:10,131 INFO L125 PetriNetUnfolderBase]: For 134/139 co-relation queries the response was YES. [2025-03-13 22:15:10,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 287 events. 33/287 cut-off events. For 134/139 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1415 event pairs, 5 based on Foata normal form. 7/287 useless extension candidates. Maximal degree in co-relation 601. Up to 40 conditions per place. [2025-03-13 22:15:10,132 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 18 selfloop transitions, 9 changer transitions 11/90 dead transitions. [2025-03-13 22:15:10,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 90 transitions, 397 flow [2025-03-13 22:15:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 460 transitions. [2025-03-13 22:15:10,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2025-03-13 22:15:10,134 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 264 flow. Second operand 9 states and 460 transitions. [2025-03-13 22:15:10,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 90 transitions, 397 flow [2025-03-13 22:15:10,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 395 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:10,137 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 289 flow [2025-03-13 22:15:10,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2025-03-13 22:15:10,139 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 27 predicate places. [2025-03-13 22:15:10,139 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 289 flow [2025-03-13 22:15:10,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:10,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:10,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:10,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:15:10,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:10,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash 397297510, now seen corresponding path program 3 times [2025-03-13 22:15:10,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:10,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559958300] [2025-03-13 22:15:10,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:15:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:10,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:10,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:10,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:15:10,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559958300] [2025-03-13 22:15:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559958300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:10,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:10,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423342361] [2025-03-13 22:15:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:10,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:10,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:10,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:10,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:10,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:10,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 289 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:10,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:10,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:10,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:10,524 INFO L124 PetriNetUnfolderBase]: 59/444 cut-off events. [2025-03-13 22:15:10,524 INFO L125 PetriNetUnfolderBase]: For 395/404 co-relation queries the response was YES. [2025-03-13 22:15:10,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 444 events. 59/444 cut-off events. For 395/404 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2781 event pairs, 7 based on Foata normal form. 5/437 useless extension candidates. Maximal degree in co-relation 1055. Up to 70 conditions per place. [2025-03-13 22:15:10,527 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 18 selfloop transitions, 19 changer transitions 3/92 dead transitions. [2025-03-13 22:15:10,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 466 flow [2025-03-13 22:15:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:15:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:15:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 510 transitions. [2025-03-13 22:15:10,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796875 [2025-03-13 22:15:10,529 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 289 flow. Second operand 10 states and 510 transitions. [2025-03-13 22:15:10,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 466 flow [2025-03-13 22:15:10,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 410 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-13 22:15:10,533 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 368 flow [2025-03-13 22:15:10,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-03-13 22:15:10,534 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 26 predicate places. [2025-03-13 22:15:10,535 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 368 flow [2025-03-13 22:15:10,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:10,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:10,535 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] [2025-03-13 22:15:10,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:15:10,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:10,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 28895378, now seen corresponding path program 4 times [2025-03-13 22:15:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129173285] [2025-03-13 22:15:10,536 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:15:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:10,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-13 22:15:10,548 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-03-13 22:15:10,548 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 22:15:10,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:10,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:10,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129173285] [2025-03-13 22:15:10,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129173285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:10,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273780450] [2025-03-13 22:15:10,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:10,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:10,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:10,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:10,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:10,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:10,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 368 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:10,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:10,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:10,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:10,887 INFO L124 PetriNetUnfolderBase]: 94/661 cut-off events. [2025-03-13 22:15:10,888 INFO L125 PetriNetUnfolderBase]: For 769/784 co-relation queries the response was YES. [2025-03-13 22:15:10,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 661 events. 94/661 cut-off events. For 769/784 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4867 event pairs, 14 based on Foata normal form. 11/652 useless extension candidates. Maximal degree in co-relation 1616. Up to 106 conditions per place. [2025-03-13 22:15:10,891 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 26 selfloop transitions, 22 changer transitions 8/108 dead transitions. [2025-03-13 22:15:10,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 108 transitions, 632 flow [2025-03-13 22:15:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 468 transitions. [2025-03-13 22:15:10,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8125 [2025-03-13 22:15:10,892 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 368 flow. Second operand 9 states and 468 transitions. [2025-03-13 22:15:10,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 108 transitions, 632 flow [2025-03-13 22:15:10,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 108 transitions, 611 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:15:10,897 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 501 flow [2025-03-13 22:15:10,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=501, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2025-03-13 22:15:10,897 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 37 predicate places. [2025-03-13 22:15:10,897 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 501 flow [2025-03-13 22:15:10,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:10,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:10,898 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] [2025-03-13 22:15:10,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:15:10,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:10,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1129952404, now seen corresponding path program 5 times [2025-03-13 22:15:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:10,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741508310] [2025-03-13 22:15:10,899 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:15:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:10,906 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:10,908 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:10,908 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:11,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:11,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741508310] [2025-03-13 22:15:11,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741508310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:11,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099914973] [2025-03-13 22:15:11,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:11,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:11,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:11,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:11,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:11,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:11,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 501 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:11,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:11,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:11,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:11,253 INFO L124 PetriNetUnfolderBase]: 91/634 cut-off events. [2025-03-13 22:15:11,254 INFO L125 PetriNetUnfolderBase]: For 1265/1285 co-relation queries the response was YES. [2025-03-13 22:15:11,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 634 events. 91/634 cut-off events. For 1265/1285 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4605 event pairs, 14 based on Foata normal form. 12/624 useless extension candidates. Maximal degree in co-relation 1696. Up to 100 conditions per place. [2025-03-13 22:15:11,257 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 23 selfloop transitions, 22 changer transitions 9/106 dead transitions. [2025-03-13 22:15:11,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 106 transitions, 712 flow [2025-03-13 22:15:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 465 transitions. [2025-03-13 22:15:11,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8072916666666666 [2025-03-13 22:15:11,258 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 501 flow. Second operand 9 states and 465 transitions. [2025-03-13 22:15:11,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 106 transitions, 712 flow [2025-03-13 22:15:11,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 686 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-13 22:15:11,262 INFO L231 Difference]: Finished difference. Result has 105 places, 89 transitions, 553 flow [2025-03-13 22:15:11,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=553, PETRI_PLACES=105, PETRI_TRANSITIONS=89} [2025-03-13 22:15:11,263 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 43 predicate places. [2025-03-13 22:15:11,263 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 89 transitions, 553 flow [2025-03-13 22:15:11,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:11,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:11,263 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] [2025-03-13 22:15:11,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:15:11,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:11,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash -321221056, now seen corresponding path program 6 times [2025-03-13 22:15:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707817804] [2025-03-13 22:15:11,264 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 22:15:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:11,270 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:11,273 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:11,274 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 22:15:11,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:11,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:11,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707817804] [2025-03-13 22:15:11,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707817804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:11,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:11,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253928057] [2025-03-13 22:15:11,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:11,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:11,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:11,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:11,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:11,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:11,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 89 transitions, 553 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:11,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:11,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:11,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:11,551 INFO L124 PetriNetUnfolderBase]: 88/608 cut-off events. [2025-03-13 22:15:11,551 INFO L125 PetriNetUnfolderBase]: For 1856/1876 co-relation queries the response was YES. [2025-03-13 22:15:11,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 608 events. 88/608 cut-off events. For 1856/1876 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4373 event pairs, 12 based on Foata normal form. 8/596 useless extension candidates. Maximal degree in co-relation 1710. Up to 96 conditions per place. [2025-03-13 22:15:11,554 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 23 selfloop transitions, 24 changer transitions 2/101 dead transitions. [2025-03-13 22:15:11,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 101 transitions, 722 flow [2025-03-13 22:15:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:15:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:15:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 516 transitions. [2025-03-13 22:15:11,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.80625 [2025-03-13 22:15:11,555 INFO L175 Difference]: Start difference. First operand has 105 places, 89 transitions, 553 flow. Second operand 10 states and 516 transitions. [2025-03-13 22:15:11,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 101 transitions, 722 flow [2025-03-13 22:15:11,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 650 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-13 22:15:11,560 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 602 flow [2025-03-13 22:15:11,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=602, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2025-03-13 22:15:11,561 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 45 predicate places. [2025-03-13 22:15:11,561 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 602 flow [2025-03-13 22:15:11,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:11,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:11,561 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] [2025-03-13 22:15:11,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:15:11,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:11,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1551280858, now seen corresponding path program 7 times [2025-03-13 22:15:11,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:11,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114916415] [2025-03-13 22:15:11,562 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 22:15:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:11,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:11,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:11,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:11,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114916415] [2025-03-13 22:15:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114916415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050332884] [2025-03-13 22:15:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:11,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:11,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:11,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:11,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:11,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 602 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:11,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:11,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:11,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:11,803 INFO L124 PetriNetUnfolderBase]: 59/469 cut-off events. [2025-03-13 22:15:11,803 INFO L125 PetriNetUnfolderBase]: For 1278/1295 co-relation queries the response was YES. [2025-03-13 22:15:11,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 469 events. 59/469 cut-off events. For 1278/1295 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3014 event pairs, 9 based on Foata normal form. 7/462 useless extension candidates. Maximal degree in co-relation 1306. Up to 72 conditions per place. [2025-03-13 22:15:11,805 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 19 selfloop transitions, 14 changer transitions 8/93 dead transitions. [2025-03-13 22:15:11,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 93 transitions, 636 flow [2025-03-13 22:15:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 462 transitions. [2025-03-13 22:15:11,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2025-03-13 22:15:11,807 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 602 flow. Second operand 9 states and 462 transitions. [2025-03-13 22:15:11,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 93 transitions, 636 flow [2025-03-13 22:15:11,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 93 transitions, 596 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-13 22:15:11,811 INFO L231 Difference]: Finished difference. Result has 109 places, 83 transitions, 471 flow [2025-03-13 22:15:11,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=471, PETRI_PLACES=109, PETRI_TRANSITIONS=83} [2025-03-13 22:15:11,812 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 47 predicate places. [2025-03-13 22:15:11,812 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 83 transitions, 471 flow [2025-03-13 22:15:11,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:11,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:11,812 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] [2025-03-13 22:15:11,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:15:11,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:11,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash 668660300, now seen corresponding path program 8 times [2025-03-13 22:15:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:11,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722462398] [2025-03-13 22:15:11,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:11,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:11,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:11,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722462398] [2025-03-13 22:15:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722462398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:11,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:11,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989191859] [2025-03-13 22:15:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:11,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:11,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:11,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:11,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:11,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 83 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:11,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:11,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:11,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:12,040 INFO L124 PetriNetUnfolderBase]: 25/275 cut-off events. [2025-03-13 22:15:12,041 INFO L125 PetriNetUnfolderBase]: For 539/546 co-relation queries the response was YES. [2025-03-13 22:15:12,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 275 events. 25/275 cut-off events. For 539/546 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1361 event pairs, 6 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 724. Up to 40 conditions per place. [2025-03-13 22:15:12,042 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 12 selfloop transitions, 8 changer transitions 8/80 dead transitions. [2025-03-13 22:15:12,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 80 transitions, 461 flow [2025-03-13 22:15:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 22:15:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 22:15:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2025-03-13 22:15:12,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7890625 [2025-03-13 22:15:12,043 INFO L175 Difference]: Start difference. First operand has 109 places, 83 transitions, 471 flow. Second operand 8 states and 404 transitions. [2025-03-13 22:15:12,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 80 transitions, 461 flow [2025-03-13 22:15:12,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 80 transitions, 403 flow, removed 8 selfloop flow, removed 14 redundant places. [2025-03-13 22:15:12,046 INFO L231 Difference]: Finished difference. Result has 95 places, 70 transitions, 300 flow [2025-03-13 22:15:12,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=95, PETRI_TRANSITIONS=70} [2025-03-13 22:15:12,047 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2025-03-13 22:15:12,047 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 70 transitions, 300 flow [2025-03-13 22:15:12,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:12,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:12,047 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] [2025-03-13 22:15:12,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:15:12,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2139224986, now seen corresponding path program 9 times [2025-03-13 22:15:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56004498] [2025-03-13 22:15:12,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:15:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:12,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:15:12,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:15:12,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:15:12,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56004498] [2025-03-13 22:15:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56004498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:12,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:12,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148019577] [2025-03-13 22:15:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:12,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:12,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:12,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:12,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:12,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 70 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:12,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:12,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:12,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:12,277 INFO L124 PetriNetUnfolderBase]: 23/229 cut-off events. [2025-03-13 22:15:12,277 INFO L125 PetriNetUnfolderBase]: For 282/287 co-relation queries the response was YES. [2025-03-13 22:15:12,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 229 events. 23/229 cut-off events. For 282/287 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1043 event pairs, 4 based on Foata normal form. 4/227 useless extension candidates. Maximal degree in co-relation 571. Up to 32 conditions per place. [2025-03-13 22:15:12,278 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 8 selfloop transitions, 12 changer transitions 3/75 dead transitions. [2025-03-13 22:15:12,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 75 transitions, 362 flow [2025-03-13 22:15:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 22:15:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 22:15:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 400 transitions. [2025-03-13 22:15:12,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78125 [2025-03-13 22:15:12,280 INFO L175 Difference]: Start difference. First operand has 95 places, 70 transitions, 300 flow. Second operand 8 states and 400 transitions. [2025-03-13 22:15:12,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 75 transitions, 362 flow [2025-03-13 22:15:12,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 75 transitions, 312 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-03-13 22:15:12,282 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 280 flow [2025-03-13 22:15:12,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=280, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2025-03-13 22:15:12,282 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 21 predicate places. [2025-03-13 22:15:12,282 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 280 flow [2025-03-13 22:15:12,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:12,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:12,283 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] [2025-03-13 22:15:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:15:12,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 157986908, now seen corresponding path program 10 times [2025-03-13 22:15:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893657982] [2025-03-13 22:15:12,284 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:15:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:12,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-13 22:15:12,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-03-13 22:15:12,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 22:15:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:12,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893657982] [2025-03-13 22:15:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893657982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:12,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:15:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747620120] [2025-03-13 22:15:12,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:12,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:15:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:12,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:15:12,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:15:12,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 64 [2025-03-13 22:15:12,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:12,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:12,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 64 [2025-03-13 22:15:12,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:12,505 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2025-03-13 22:15:12,505 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-13 22:15:12,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 72 events. 5/72 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 1 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 152. Up to 9 conditions per place. [2025-03-13 22:15:12,506 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 0 selfloop transitions, 0 changer transitions 48/48 dead transitions. [2025-03-13 22:15:12,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 48 transitions, 193 flow [2025-03-13 22:15:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 22:15:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 22:15:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 345 transitions. [2025-03-13 22:15:12,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7700892857142857 [2025-03-13 22:15:12,508 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 280 flow. Second operand 7 states and 345 transitions. [2025-03-13 22:15:12,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 48 transitions, 193 flow [2025-03-13 22:15:12,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 48 transitions, 149 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-13 22:15:12,509 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2025-03-13 22:15:12,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2025-03-13 22:15:12,509 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2025-03-13 22:15:12,509 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2025-03-13 22:15:12,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:15:12,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-13 22:15:12,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-13 22:15:12,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-13 22:15:12,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-13 22:15:12,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-13 22:15:12,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-13 22:15:12,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-13 22:15:12,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:15:12,514 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2025-03-13 22:15:12,518 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:15:12,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:15:12,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:15:12 BasicIcfg [2025-03-13 22:15:12,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:15:12,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:15:12,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:15:12,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:15:12,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:08" (3/4) ... [2025-03-13 22:15:12,524 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:15:12,527 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-13 22:15:12,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-13 22:15:12,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-13 22:15:12,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-13 22:15:12,586 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:15:12,586 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:15:12,586 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:15:12,587 INFO L158 Benchmark]: Toolchain (without parser) took 4871.90ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 110.9MB in the beginning and 255.4MB in the end (delta: -144.6MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2025-03-13 22:15:12,587 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:12,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.59ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 83.7MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 22:15:12,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.62ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:12,588 INFO L158 Benchmark]: Boogie Preprocessor took 14.83ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 80.8MB in the end (delta: 886.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:12,589 INFO L158 Benchmark]: IcfgBuilder took 266.24ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 67.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:12,589 INFO L158 Benchmark]: TraceAbstraction took 4056.20ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 66.6MB in the beginning and 259.4MB in the end (delta: -192.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2025-03-13 22:15:12,589 INFO L158 Benchmark]: Witness Printer took 63.67ms. Allocated memory is still 385.9MB. Free memory was 259.4MB in the beginning and 255.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:12,590 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.59ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 83.7MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.62ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.83ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 80.8MB in the end (delta: 886.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 266.24ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 67.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4056.20ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 66.6MB in the beginning and 259.4MB in the end (delta: -192.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 63.67ms. Allocated memory is still 385.9MB. Free memory was 259.4MB in the beginning and 255.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 921]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 921]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 921]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 921]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 88 locations, 7 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: 4.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 788 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 647 mSDsluCounter, 1112 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1012 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1681 IncrementalHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 100 mSDtfsCounter, 1681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred in iteration=9, InterpolantAutomatonStates: 99, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 454 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 1095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:15:12,604 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 Result: TRUE