./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/szymanski.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 a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:58:10,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:58:10,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:58:10,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:58:10,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:58:10,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:58:10,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:58:10,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:58:10,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:58:10,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:58:10,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:58:10,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:58:10,763 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:58:10,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:58:10,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:58:10,763 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:58:10,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:58:10,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:58:10,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:58:10,764 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:58:10,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:58:10,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:58:10,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:10,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:58:10,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:58:10,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:58:10,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:58:10,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:58:10,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:58:10,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:58:10,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:58:10,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:58:10,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:58:10,766 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 -> a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 [2025-03-13 21:58:11,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:58:11,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:58:11,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:58:11,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:58:11,021 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:58:11,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/szymanski.i [2025-03-13 21:58:12,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802737f9/9f0b5498a98f4dc8b796a4981388d435/FLAGe605e18af [2025-03-13 21:58:12,514 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:58:12,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski.i [2025-03-13 21:58:12,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802737f9/9f0b5498a98f4dc8b796a4981388d435/FLAGe605e18af [2025-03-13 21:58:12,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802737f9/9f0b5498a98f4dc8b796a4981388d435 [2025-03-13 21:58:12,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:58:12,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:58:12,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:12,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:58:12,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:58:12,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23948c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12, skipping insertion in model container [2025-03-13 21:58:12,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:58:13,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:13,058 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:58:13,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:13,123 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:58:13,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13 WrapperNode [2025-03-13 21:58:13,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:13,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:13,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:58:13,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:58:13,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,157 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-03-13 21:58:13,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:13,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:58:13,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:58:13,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:58:13,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:58:13,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:58:13,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:58:13,174 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:58:13,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (1/1) ... [2025-03-13 21:58:13,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:13,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:13,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:58:13,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:58:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-13 21:58:13,223 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-13 21:58:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:58:13,223 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:58:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:58:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:58:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:58:13,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:58:13,225 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:58:13,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:58:13,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:58:13,470 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:58:13,472 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:58:13,472 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:58:13,495 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:58:13,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:13 BoogieIcfgContainer [2025-03-13 21:58:13,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:58:13,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:58:13,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:58:13,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:58:13,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:58:12" (1/3) ... [2025-03-13 21:58:13,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2602af14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:13, skipping insertion in model container [2025-03-13 21:58:13,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:13" (2/3) ... [2025-03-13 21:58:13,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2602af14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:13, skipping insertion in model container [2025-03-13 21:58:13,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:13" (3/3) ... [2025-03-13 21:58:13,504 INFO L128 eAbstractionObserver]: Analyzing ICFG szymanski.i [2025-03-13 21:58:13,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:58:13,518 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG szymanski.i that has 3 procedures, 88 locations, 1 initial locations, 8 loop locations, and 4 error locations. [2025-03-13 21:58:13,518 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:58:13,580 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:58:13,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 101 transitions, 216 flow [2025-03-13 21:58:13,640 INFO L124 PetriNetUnfolderBase]: 14/99 cut-off events. [2025-03-13 21:58:13,644 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:58:13,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 99 events. 14/99 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 78. Up to 3 conditions per place. [2025-03-13 21:58:13,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 101 transitions, 216 flow [2025-03-13 21:58:13,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 94 transitions, 197 flow [2025-03-13 21:58:13,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:13,668 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;@53a1580b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:13,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 21:58:13,681 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:13,681 INFO L124 PetriNetUnfolderBase]: 5/49 cut-off events. [2025-03-13 21:58:13,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:13,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,682 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] [2025-03-13 21:58:13,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:58:13,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1424493091, now seen corresponding path program 1 times [2025-03-13 21:58:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70262601] [2025-03-13 21:58:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:58:13,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:58:13,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70262601] [2025-03-13 21:58:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70262601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833018646] [2025-03-13 21:58:13,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 101 [2025-03-13 21:58:13,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:13,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 101 [2025-03-13 21:58:13,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,053 INFO L124 PetriNetUnfolderBase]: 145/454 cut-off events. [2025-03-13 21:58:14,054 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-13 21:58:14,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 454 events. 145/454 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2286 event pairs, 72 based on Foata normal form. 43/408 useless extension candidates. Maximal degree in co-relation 637. Up to 177 conditions per place. [2025-03-13 21:58:14,061 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 26 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2025-03-13 21:58:14,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 270 flow [2025-03-13 21:58:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-03-13 21:58:14,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679867986798679 [2025-03-13 21:58:14,074 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 197 flow. Second operand 3 states and 263 transitions. [2025-03-13 21:58:14,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 270 flow [2025-03-13 21:58:14,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 98 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:58:14,082 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 218 flow [2025-03-13 21:58:14,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2025-03-13 21:58:14,087 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -1 predicate places. [2025-03-13 21:58:14,088 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 218 flow [2025-03-13 21:58:14,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:14,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:58:14,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:58:14,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1498417141, now seen corresponding path program 1 times [2025-03-13 21:58:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831027514] [2025-03-13 21:58:14,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:14,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:58:14,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:58:14,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:14,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831027514] [2025-03-13 21:58:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831027514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189164190] [2025-03-13 21:58:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 101 [2025-03-13 21:58:14,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 101 [2025-03-13 21:58:14,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,270 INFO L124 PetriNetUnfolderBase]: 147/543 cut-off events. [2025-03-13 21:58:14,271 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-13 21:58:14,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 543 events. 147/543 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2903 event pairs, 39 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 771. Up to 128 conditions per place. [2025-03-13 21:58:14,275 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 34 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2025-03-13 21:58:14,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 347 flow [2025-03-13 21:58:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-03-13 21:58:14,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778877887788779 [2025-03-13 21:58:14,279 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 218 flow. Second operand 3 states and 266 transitions. [2025-03-13 21:58:14,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 347 flow [2025-03-13 21:58:14,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 110 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,281 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 270 flow [2025-03-13 21:58:14,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=88, PETRI_TRANSITIONS=98} [2025-03-13 21:58:14,282 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 1 predicate places. [2025-03-13 21:58:14,282 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 270 flow [2025-03-13 21:58:14,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,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] [2025-03-13 21:58:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:58:14,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:58:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -349978269, now seen corresponding path program 1 times [2025-03-13 21:58:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497297969] [2025-03-13 21:58:14,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:58:14,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:58:14,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:14,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497297969] [2025-03-13 21:58:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497297969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059457385] [2025-03-13 21:58:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 101 [2025-03-13 21:58:14,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 101 [2025-03-13 21:58:14,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,447 INFO L124 PetriNetUnfolderBase]: 180/644 cut-off events. [2025-03-13 21:58:14,447 INFO L125 PetriNetUnfolderBase]: For 214/220 co-relation queries the response was YES. [2025-03-13 21:58:14,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 644 events. 180/644 cut-off events. For 214/220 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3672 event pairs, 73 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 1054. Up to 222 conditions per place. [2025-03-13 21:58:14,451 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 26 selfloop transitions, 7 changer transitions 6/108 dead transitions. [2025-03-13 21:58:14,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 373 flow [2025-03-13 21:58:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-03-13 21:58:14,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481848184818482 [2025-03-13 21:58:14,452 INFO L175 Difference]: Start difference. First operand has 88 places, 98 transitions, 270 flow. Second operand 3 states and 257 transitions. [2025-03-13 21:58:14,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 373 flow [2025-03-13 21:58:14,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 108 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,458 INFO L231 Difference]: Finished difference. Result has 90 places, 98 transitions, 290 flow [2025-03-13 21:58:14,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=90, PETRI_TRANSITIONS=98} [2025-03-13 21:58:14,459 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2025-03-13 21:58:14,459 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 98 transitions, 290 flow [2025-03-13 21:58:14,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:14,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:58:14,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:58:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1579095477, now seen corresponding path program 1 times [2025-03-13 21:58:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360120320] [2025-03-13 21:58:14,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:58:14,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:58:14,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360120320] [2025-03-13 21:58:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360120320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830788770] [2025-03-13 21:58:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 101 [2025-03-13 21:58:14,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 98 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 101 [2025-03-13 21:58:14,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,656 INFO L124 PetriNetUnfolderBase]: 146/631 cut-off events. [2025-03-13 21:58:14,657 INFO L125 PetriNetUnfolderBase]: For 162/168 co-relation queries the response was YES. [2025-03-13 21:58:14,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 631 events. 146/631 cut-off events. For 162/168 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3635 event pairs, 47 based on Foata normal form. 14/577 useless extension candidates. Maximal degree in co-relation 994. Up to 126 conditions per place. [2025-03-13 21:58:14,660 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 25 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2025-03-13 21:58:14,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 379 flow [2025-03-13 21:58:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-03-13 21:58:14,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778877887788779 [2025-03-13 21:58:14,662 INFO L175 Difference]: Start difference. First operand has 90 places, 98 transitions, 290 flow. Second operand 3 states and 266 transitions. [2025-03-13 21:58:14,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 379 flow [2025-03-13 21:58:14,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,667 INFO L231 Difference]: Finished difference. Result has 92 places, 103 transitions, 328 flow [2025-03-13 21:58:14,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=92, PETRI_TRANSITIONS=103} [2025-03-13 21:58:14,669 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2025-03-13 21:58:14,669 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 103 transitions, 328 flow [2025-03-13 21:58:14,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:14,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:58:14,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:58:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 970744191, now seen corresponding path program 2 times [2025-03-13 21:58:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041063239] [2025-03-13 21:58:14,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:58:14,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:58:14,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:58:14,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:14,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041063239] [2025-03-13 21:58:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041063239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146492932] [2025-03-13 21:58:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 101 [2025-03-13 21:58:14,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 103 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 101 [2025-03-13 21:58:14,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,806 INFO L124 PetriNetUnfolderBase]: 165/679 cut-off events. [2025-03-13 21:58:14,806 INFO L125 PetriNetUnfolderBase]: For 274/290 co-relation queries the response was YES. [2025-03-13 21:58:14,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 679 events. 165/679 cut-off events. For 274/290 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3884 event pairs, 39 based on Foata normal form. 8/602 useless extension candidates. Maximal degree in co-relation 1185. Up to 102 conditions per place. [2025-03-13 21:58:14,809 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 27 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-13 21:58:14,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 439 flow [2025-03-13 21:58:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-03-13 21:58:14,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745874587458746 [2025-03-13 21:58:14,810 INFO L175 Difference]: Start difference. First operand has 92 places, 103 transitions, 328 flow. Second operand 3 states and 265 transitions. [2025-03-13 21:58:14,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 439 flow [2025-03-13 21:58:14,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,813 INFO L231 Difference]: Finished difference. Result has 94 places, 108 transitions, 386 flow [2025-03-13 21:58:14,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=94, PETRI_TRANSITIONS=108} [2025-03-13 21:58:14,814 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 7 predicate places. [2025-03-13 21:58:14,814 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 108 transitions, 386 flow [2025-03-13 21:58:14,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:14,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:58:14,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:58:14,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1741720129, now seen corresponding path program 3 times [2025-03-13 21:58:14,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814968637] [2025-03-13 21:58:14,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:58:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:58:14,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:58:14,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:58:14,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814968637] [2025-03-13 21:58:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814968637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427541859] [2025-03-13 21:58:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 101 [2025-03-13 21:58:14,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 108 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 101 [2025-03-13 21:58:14,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,943 INFO L124 PetriNetUnfolderBase]: 164/659 cut-off events. [2025-03-13 21:58:14,944 INFO L125 PetriNetUnfolderBase]: For 514/539 co-relation queries the response was YES. [2025-03-13 21:58:14,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 659 events. 164/659 cut-off events. For 514/539 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3707 event pairs, 37 based on Foata normal form. 9/575 useless extension candidates. Maximal degree in co-relation 1267. Up to 166 conditions per place. [2025-03-13 21:58:14,947 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 31 selfloop transitions, 5 changer transitions 1/115 dead transitions. [2025-03-13 21:58:14,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 115 transitions, 479 flow [2025-03-13 21:58:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-03-13 21:58:14,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679867986798679 [2025-03-13 21:58:14,948 INFO L175 Difference]: Start difference. First operand has 94 places, 108 transitions, 386 flow. Second operand 3 states and 263 transitions. [2025-03-13 21:58:14,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 115 transitions, 479 flow [2025-03-13 21:58:14,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 115 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,952 INFO L231 Difference]: Finished difference. Result has 96 places, 107 transitions, 402 flow [2025-03-13 21:58:14,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=96, PETRI_TRANSITIONS=107} [2025-03-13 21:58:14,953 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 9 predicate places. [2025-03-13 21:58:14,953 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 107 transitions, 402 flow [2025-03-13 21:58:14,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:14,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:58:14,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 21:58:14,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash -281775617, now seen corresponding path program 4 times [2025-03-13 21:58:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055218366] [2025-03-13 21:58:14,954 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:58:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,960 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-13 21:58:14,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 44 statements. [2025-03-13 21:58:14,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:58:14,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:14,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055218366] [2025-03-13 21:58:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055218366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155734654] [2025-03-13 21:58:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 101 [2025-03-13 21:58:14,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 107 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:14,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 101 [2025-03-13 21:58:14,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:15,055 INFO L124 PetriNetUnfolderBase]: 161/539 cut-off events. [2025-03-13 21:58:15,055 INFO L125 PetriNetUnfolderBase]: For 465/484 co-relation queries the response was YES. [2025-03-13 21:58:15,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 539 events. 161/539 cut-off events. For 465/484 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2603 event pairs, 44 based on Foata normal form. 16/527 useless extension candidates. Maximal degree in co-relation 1111. Up to 156 conditions per place. [2025-03-13 21:58:15,057 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 0 selfloop transitions, 0 changer transitions 110/110 dead transitions. [2025-03-13 21:58:15,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 110 transitions, 501 flow [2025-03-13 21:58:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-03-13 21:58:15,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778877887788779 [2025-03-13 21:58:15,058 INFO L175 Difference]: Start difference. First operand has 96 places, 107 transitions, 402 flow. Second operand 3 states and 266 transitions. [2025-03-13 21:58:15,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 110 transitions, 501 flow [2025-03-13 21:58:15,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 110 transitions, 455 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-13 21:58:15,061 INFO L231 Difference]: Finished difference. Result has 88 places, 0 transitions, 0 flow [2025-03-13 21:58:15,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=88, PETRI_TRANSITIONS=0} [2025-03-13 21:58:15,062 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 1 predicate places. [2025-03-13 21:58:15,062 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 0 transitions, 0 flow [2025-03-13 21:58:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:15,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-03-13 21:58:15,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 21:58:15,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 21:58:15,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 21:58:15,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2025-03-13 21:58:15,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2025-03-13 21:58:15,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 21:58:15,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 21:58:15,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 21:58:15,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 21:58:15,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:58:15,065 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2025-03-13 21:58:15,069 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:58:15,069 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:58:15,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:58:15 BasicIcfg [2025-03-13 21:58:15,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:58:15,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:58:15,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:58:15,076 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:58:15,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:13" (3/4) ... [2025-03-13 21:58:15,078 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:58:15,080 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-03-13 21:58:15,080 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-03-13 21:58:15,082 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-13 21:58:15,083 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 21:58:15,083 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:58:15,083 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:58:15,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:58:15,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:58:15,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:58:15,138 INFO L158 Benchmark]: Toolchain (without parser) took 2347.57ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 65.5MB in the end (delta: 38.7MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,139 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:15,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.99ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.2MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.87ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:15,141 INFO L158 Benchmark]: Boogie Preprocessor took 14.87ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 963.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:15,141 INFO L158 Benchmark]: IcfgBuilder took 321.91ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 67.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,141 INFO L158 Benchmark]: TraceAbstraction took 1577.60ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 70.8MB in the end (delta: -3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:15,141 INFO L158 Benchmark]: Witness Printer took 61.82ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 65.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,142 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.99ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.2MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.87ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.87ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 963.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.91ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 67.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1577.60ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 70.8MB in the end (delta: -3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.82ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 65.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 744]: 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 5 procedures, 146 locations, 10 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: 1.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 367 IncrementalHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 37 mSDtfsCounter, 367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=6, InterpolantAutomatonStates: 21, 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, 0.3s InterpolantComputationTime, 269 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 21:58:15,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE