/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:50:12,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:50:12,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 21:50:12,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:50:12,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:50:12,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:50:12,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:50:12,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:50:12,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:50:12,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:50:12,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:50:12,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:50:12,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:50:12,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:50:12,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:50:12,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:50:12,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:50:12,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:50:12,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:50:12,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:50:12,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 21:50:13,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:50:13,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:50:13,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:50:13,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:50:13,081 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:50:13,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-03-14 21:50:14,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28fc45d1/45336563867d4c77b087d15fef49999b/FLAG2114218d3 [2025-03-14 21:50:14,430 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:50:14,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-03-14 21:50:14,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28fc45d1/45336563867d4c77b087d15fef49999b/FLAG2114218d3 [2025-03-14 21:50:14,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28fc45d1/45336563867d4c77b087d15fef49999b [2025-03-14 21:50:14,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:50:14,812 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:50:14,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:50:14,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:50:14,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:50:14,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:50:14" (1/1) ... [2025-03-14 21:50:14,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9293942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:14, skipping insertion in model container [2025-03-14 21:50:14,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:50:14" (1/1) ... [2025-03-14 21:50:14,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:50:14,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-03-14 21:50:15,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:50:15,041 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:50:15,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-03-14 21:50:15,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:50:15,091 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:50:15,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15 WrapperNode [2025-03-14 21:50:15,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:50:15,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:50:15,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:50:15,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:50:15,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,122 INFO L138 Inliner]: procedures = 162, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-03-14 21:50:15,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:50:15,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:50:15,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:50:15,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:50:15,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:50:15,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:50:15,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:50:15,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:50:15,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (1/1) ... [2025-03-14 21:50:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:50:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:50:15,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 21:50:15,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 21:50:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-14 21:50:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-14 21:50:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:50:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:50:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:50:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:50:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:50:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:50:15,200 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 21:50:15,274 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:50:15,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:50:15,447 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:50:15,447 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:50:15,480 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:50:15,480 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:50:15,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:50:15 BoogieIcfgContainer [2025-03-14 21:50:15,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:50:15,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:50:15,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:50:15,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:50:15,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:50:14" (1/3) ... [2025-03-14 21:50:15,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7945d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:50:15, skipping insertion in model container [2025-03-14 21:50:15,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:15" (2/3) ... [2025-03-14 21:50:15,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7945d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:50:15, skipping insertion in model container [2025-03-14 21:50:15,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:50:15" (3/3) ... [2025-03-14 21:50:15,489 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2025-03-14 21:50:15,500 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:50:15,502 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_29-multiple-protecting2-vesal_true.i that has 2 procedures, 108 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-14 21:50:15,502 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:50:15,549 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 21:50:15,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:50:15,593 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=All, 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;@25b96f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:50:15,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 21:50:15,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:50:15,629 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-03-14 21:50:15,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:50:15,630 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:15,632 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:15,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:15,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 784578988, now seen corresponding path program 1 times [2025-03-14 21:50:15,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675132925] [2025-03-14 21:50:15,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:16,037 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-14 21:50:16,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:16,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675132925] [2025-03-14 21:50:16,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675132925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:16,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:16,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186405748] [2025-03-14 21:50:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:16,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:16,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:16,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:16,062 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 110 [2025-03-14 21:50:16,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 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-14 21:50:16,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:16,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 110 [2025-03-14 21:50:16,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:16,383 INFO L124 PetriNetUnfolderBase]: 316/989 cut-off events. [2025-03-14 21:50:16,383 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 21:50:16,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 989 events. 316/989 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5570 event pairs, 93 based on Foata normal form. 29/987 useless extension candidates. Maximal degree in co-relation 1625. Up to 375 conditions per place. [2025-03-14 21:50:16,398 INFO L140 encePairwiseOnDemand]: 95/110 looper letters, 74 selfloop transitions, 18 changer transitions 20/166 dead transitions. [2025-03-14 21:50:16,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 166 transitions, 548 flow [2025-03-14 21:50:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:50:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:50:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 670 transitions. [2025-03-14 21:50:16,413 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2025-03-14 21:50:16,415 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2025-03-14 21:50:16,415 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 166 transitions, 548 flow [2025-03-14 21:50:16,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 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-14 21:50:16,415 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:16,416 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:16,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:50:16,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:16,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2125174989, now seen corresponding path program 1 times [2025-03-14 21:50:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124470409] [2025-03-14 21:50:16,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:16,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:16,583 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-14 21:50:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124470409] [2025-03-14 21:50:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124470409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884327009] [2025-03-14 21:50:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:16,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:16,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:16,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:16,587 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 110 [2025-03-14 21:50:16,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 166 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 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-14 21:50:16,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:16,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 110 [2025-03-14 21:50:16,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:16,862 INFO L124 PetriNetUnfolderBase]: 342/1049 cut-off events. [2025-03-14 21:50:16,862 INFO L125 PetriNetUnfolderBase]: For 186/200 co-relation queries the response was YES. [2025-03-14 21:50:16,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2528 conditions, 1049 events. 342/1049 cut-off events. For 186/200 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5988 event pairs, 108 based on Foata normal form. 10/1032 useless extension candidates. Maximal degree in co-relation 2475. Up to 426 conditions per place. [2025-03-14 21:50:16,867 INFO L140 encePairwiseOnDemand]: 98/110 looper letters, 109 selfloop transitions, 23 changer transitions 24/210 dead transitions. [2025-03-14 21:50:16,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 210 transitions, 1022 flow [2025-03-14 21:50:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:50:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:50:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 664 transitions. [2025-03-14 21:50:16,869 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6707070707070707 [2025-03-14 21:50:16,871 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2025-03-14 21:50:16,871 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 210 transitions, 1022 flow [2025-03-14 21:50:16,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 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-14 21:50:16,871 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:16,871 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:16,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:50:16,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1783618464, now seen corresponding path program 1 times [2025-03-14 21:50:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536116080] [2025-03-14 21:50:16,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:50:17,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:17,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536116080] [2025-03-14 21:50:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536116080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:17,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:50:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639915377] [2025-03-14 21:50:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:17,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:50:17,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:17,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:50:17,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:50:17,015 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 110 [2025-03-14 21:50:17,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 210 transitions, 1022 flow. Second operand has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 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-14 21:50:17,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:17,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 110 [2025-03-14 21:50:17,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:17,451 INFO L124 PetriNetUnfolderBase]: 417/1232 cut-off events. [2025-03-14 21:50:17,451 INFO L125 PetriNetUnfolderBase]: For 641/641 co-relation queries the response was YES. [2025-03-14 21:50:17,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 1232 events. 417/1232 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7256 event pairs, 32 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 3786. Up to 523 conditions per place. [2025-03-14 21:50:17,457 INFO L140 encePairwiseOnDemand]: 88/110 looper letters, 153 selfloop transitions, 83 changer transitions 71/360 dead transitions. [2025-03-14 21:50:17,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 360 transitions, 2510 flow [2025-03-14 21:50:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 21:50:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 21:50:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1382 transitions. [2025-03-14 21:50:17,462 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.661244019138756 [2025-03-14 21:50:17,462 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 30 predicate places. [2025-03-14 21:50:17,462 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 360 transitions, 2510 flow [2025-03-14 21:50:17,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 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-14 21:50:17,463 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:17,463 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:17,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:50:17,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 316465391, now seen corresponding path program 1 times [2025-03-14 21:50:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847116644] [2025-03-14 21:50:17,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:17,594 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-14 21:50:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847116644] [2025-03-14 21:50:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847116644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:50:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182678767] [2025-03-14 21:50:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:17,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:50:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:17,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:50:17,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:50:17,596 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 110 [2025-03-14 21:50:17,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 360 transitions, 2510 flow. Second operand has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 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-14 21:50:17,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:17,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 110 [2025-03-14 21:50:17,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:17,973 INFO L124 PetriNetUnfolderBase]: 422/1249 cut-off events. [2025-03-14 21:50:17,973 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2025-03-14 21:50:17,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 1249 events. 422/1249 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7324 event pairs, 42 based on Foata normal form. 0/1235 useless extension candidates. Maximal degree in co-relation 4759. Up to 534 conditions per place. [2025-03-14 21:50:17,979 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 166 selfloop transitions, 92 changer transitions 94/405 dead transitions. [2025-03-14 21:50:17,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 405 transitions, 3536 flow [2025-03-14 21:50:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 21:50:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 21:50:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1375 transitions. [2025-03-14 21:50:17,982 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2025-03-14 21:50:17,982 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 48 predicate places. [2025-03-14 21:50:17,983 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 405 transitions, 3536 flow [2025-03-14 21:50:17,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 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-14 21:50:17,983 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:17,983 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:17,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:50:17,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:17,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2106990353, now seen corresponding path program 1 times [2025-03-14 21:50:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:17,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960096974] [2025-03-14 21:50:17,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:18,092 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-14 21:50:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960096974] [2025-03-14 21:50:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960096974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:18,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:50:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40531632] [2025-03-14 21:50:18,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:18,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:50:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:18,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:50:18,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:50:18,094 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 110 [2025-03-14 21:50:18,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 405 transitions, 3536 flow. Second operand has 9 states, 9 states have (on average 61.888888888888886) internal successors, (557), 9 states have internal predecessors, (557), 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-14 21:50:18,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:18,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 110 [2025-03-14 21:50:18,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:18,675 INFO L124 PetriNetUnfolderBase]: 473/1292 cut-off events. [2025-03-14 21:50:18,675 INFO L125 PetriNetUnfolderBase]: For 1934/1934 co-relation queries the response was YES. [2025-03-14 21:50:18,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6070 conditions, 1292 events. 473/1292 cut-off events. For 1934/1934 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7319 event pairs, 22 based on Foata normal form. 0/1279 useless extension candidates. Maximal degree in co-relation 6005. Up to 571 conditions per place. [2025-03-14 21:50:18,681 INFO L140 encePairwiseOnDemand]: 88/110 looper letters, 200 selfloop transitions, 140 changer transitions 116/507 dead transitions. [2025-03-14 21:50:18,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 507 transitions, 5438 flow [2025-03-14 21:50:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 21:50:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 21:50:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1968 transitions. [2025-03-14 21:50:18,685 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2025-03-14 21:50:18,686 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 73 predicate places. [2025-03-14 21:50:18,686 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 507 transitions, 5438 flow [2025-03-14 21:50:18,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 61.888888888888886) internal successors, (557), 9 states have internal predecessors, (557), 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-14 21:50:18,686 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:18,686 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:18,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:50:18,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:18,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1229621932, now seen corresponding path program 1 times [2025-03-14 21:50:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:18,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864843104] [2025-03-14 21:50:18,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:18,806 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-14 21:50:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864843104] [2025-03-14 21:50:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864843104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:18,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:50:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741419189] [2025-03-14 21:50:18,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:18,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:50:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:50:18,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:50:18,809 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 110 [2025-03-14 21:50:18,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 507 transitions, 5438 flow. Second operand has 9 states, 9 states have (on average 62.55555555555556) internal successors, (563), 9 states have internal predecessors, (563), 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-14 21:50:18,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:18,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 110 [2025-03-14 21:50:18,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:19,389 INFO L124 PetriNetUnfolderBase]: 470/1264 cut-off events. [2025-03-14 21:50:19,389 INFO L125 PetriNetUnfolderBase]: For 2381/2381 co-relation queries the response was YES. [2025-03-14 21:50:19,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 1264 events. 470/1264 cut-off events. For 2381/2381 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7056 event pairs, 22 based on Foata normal form. 0/1255 useless extension candidates. Maximal degree in co-relation 6950. Up to 565 conditions per place. [2025-03-14 21:50:19,395 INFO L140 encePairwiseOnDemand]: 88/110 looper letters, 202 selfloop transitions, 145 changer transitions 119/516 dead transitions. [2025-03-14 21:50:19,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 516 transitions, 6426 flow [2025-03-14 21:50:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 21:50:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 21:50:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1966 transitions. [2025-03-14 21:50:19,400 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6383116883116883 [2025-03-14 21:50:19,400 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 98 predicate places. [2025-03-14 21:50:19,401 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 516 transitions, 6426 flow [2025-03-14 21:50:19,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 62.55555555555556) internal successors, (563), 9 states have internal predecessors, (563), 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-14 21:50:19,402 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:19,402 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:50:19,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:19,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash 151165710, now seen corresponding path program 1 times [2025-03-14 21:50:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:19,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975915531] [2025-03-14 21:50:19,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:19,552 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-14 21:50:19,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975915531] [2025-03-14 21:50:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975915531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:19,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:19,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010066644] [2025-03-14 21:50:19,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:19,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:19,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:19,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:19,553 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2025-03-14 21:50:19,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 516 transitions, 6426 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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-14 21:50:19,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:19,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2025-03-14 21:50:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:19,643 INFO L124 PetriNetUnfolderBase]: 97/418 cut-off events. [2025-03-14 21:50:19,643 INFO L125 PetriNetUnfolderBase]: For 1355/1355 co-relation queries the response was YES. [2025-03-14 21:50:19,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2359 conditions, 418 events. 97/418 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1636 event pairs, 6 based on Foata normal form. 57/472 useless extension candidates. Maximal degree in co-relation 2275. Up to 170 conditions per place. [2025-03-14 21:50:19,645 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 47 selfloop transitions, 14 changer transitions 50/200 dead transitions. [2025-03-14 21:50:19,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 200 transitions, 2294 flow [2025-03-14 21:50:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 21:50:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 21:50:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2025-03-14 21:50:19,647 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2025-03-14 21:50:19,648 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 62 predicate places. [2025-03-14 21:50:19,648 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 200 transitions, 2294 flow [2025-03-14 21:50:19,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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-14 21:50:19,648 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:19,648 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:50:19,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 160948697, now seen corresponding path program 1 times [2025-03-14 21:50:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891055087] [2025-03-14 21:50:19,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:19,711 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-14 21:50:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891055087] [2025-03-14 21:50:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891055087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:19,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:19,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:50:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208221235] [2025-03-14 21:50:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:19,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:50:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:19,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:50:19,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:50:19,712 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 110 [2025-03-14 21:50:19,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 200 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-14 21:50:19,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:19,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 110 [2025-03-14 21:50:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:19,792 INFO L124 PetriNetUnfolderBase]: 109/499 cut-off events. [2025-03-14 21:50:19,792 INFO L125 PetriNetUnfolderBase]: For 2099/2099 co-relation queries the response was YES. [2025-03-14 21:50:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 499 events. 109/499 cut-off events. For 2099/2099 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2165 event pairs, 0 based on Foata normal form. 13/506 useless extension candidates. Maximal degree in co-relation 2933. Up to 218 conditions per place. [2025-03-14 21:50:19,795 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 44 selfloop transitions, 23 changer transitions 60/222 dead transitions. [2025-03-14 21:50:19,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 222 transitions, 2862 flow [2025-03-14 21:50:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:50:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:50:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2025-03-14 21:50:19,795 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8545454545454545 [2025-03-14 21:50:19,796 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 64 predicate places. [2025-03-14 21:50:19,796 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 222 transitions, 2862 flow [2025-03-14 21:50:19,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-14 21:50:19,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:19,796 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:19,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 21:50:19,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:19,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2010718945, now seen corresponding path program 2 times [2025-03-14 21:50:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219453270] [2025-03-14 21:50:19,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:50:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:19,808 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:50:19,808 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:50:19,909 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-14 21:50:19,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219453270] [2025-03-14 21:50:19,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219453270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:19,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:19,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:19,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356674110] [2025-03-14 21:50:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:19,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:19,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:19,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:19,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2025-03-14 21:50:19,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 222 transitions, 2862 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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-14 21:50:19,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:19,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2025-03-14 21:50:19,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:20,008 INFO L124 PetriNetUnfolderBase]: 55/335 cut-off events. [2025-03-14 21:50:20,008 INFO L125 PetriNetUnfolderBase]: For 1912/1912 co-relation queries the response was YES. [2025-03-14 21:50:20,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 335 events. 55/335 cut-off events. For 1912/1912 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1120 event pairs, 0 based on Foata normal form. 12/346 useless extension candidates. Maximal degree in co-relation 1940. Up to 126 conditions per place. [2025-03-14 21:50:20,010 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 41 selfloop transitions, 19 changer transitions 43/188 dead transitions. [2025-03-14 21:50:20,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 188 transitions, 2452 flow [2025-03-14 21:50:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 21:50:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 21:50:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2025-03-14 21:50:20,011 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7618181818181818 [2025-03-14 21:50:20,012 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 68 predicate places. [2025-03-14 21:50:20,012 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 188 transitions, 2452 flow [2025-03-14 21:50:20,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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-14 21:50:20,012 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:20,012 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:20,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 21:50:20,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:50:20,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:20,013 INFO L85 PathProgramCache]: Analyzing trace with hash 541572533, now seen corresponding path program 1 times [2025-03-14 21:50:20,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:20,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680913208] [2025-03-14 21:50:20,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:20,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:20,156 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-14 21:50:20,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680913208] [2025-03-14 21:50:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680913208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:20,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:20,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:50:20,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051284468] [2025-03-14 21:50:20,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:50:20,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:20,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:50:20,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:50:20,157 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 110 [2025-03-14 21:50:20,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 188 transitions, 2452 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 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-14 21:50:20,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:20,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 110 [2025-03-14 21:50:20,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:20,337 INFO L124 PetriNetUnfolderBase]: 55/333 cut-off events. [2025-03-14 21:50:20,338 INFO L125 PetriNetUnfolderBase]: For 2172/2172 co-relation queries the response was YES. [2025-03-14 21:50:20,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 333 events. 55/333 cut-off events. For 2172/2172 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1115 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 2158. Up to 125 conditions per place. [2025-03-14 21:50:20,339 INFO L140 encePairwiseOnDemand]: 90/110 looper letters, 0 selfloop transitions, 0 changer transitions 186/186 dead transitions. [2025-03-14 21:50:20,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 2696 flow [2025-03-14 21:50:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:50:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:50:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 790 transitions. [2025-03-14 21:50:20,340 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5984848484848485 [2025-03-14 21:50:20,341 INFO L298 CegarLoopForPetriNet]: 111 programPoint places, 77 predicate places. [2025-03-14 21:50:20,341 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 2696 flow [2025-03-14 21:50:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 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-14 21:50:20,345 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_29-multiple-protecting2-vesal_true.i_petrified1_AllErrorsAtOnce [2025-03-14 21:50:20,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 21:50:20,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-14 21:50:20,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-14 21:50:20,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 21:50:20,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 21:50:20,368 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:20,370 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:50:20,370 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:50:20,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:50:20 BasicIcfg [2025-03-14 21:50:20,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:50:20,373 INFO L158 Benchmark]: Toolchain (without parser) took 5560.88ms. Allocated memory was 71.3MB in the beginning and 197.1MB in the end (delta: 125.8MB). Free memory was 43.4MB in the beginning and 40.3MB in the end (delta: 3.0MB). Peak memory consumption was 126.6MB. Max. memory is 8.0GB. [2025-03-14 21:50:20,373 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:50:20,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.01ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 23.3MB in the end (delta: 20.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 21:50:20,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.38ms. Allocated memory is still 71.3MB. Free memory was 23.3MB in the beginning and 21.4MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 21:50:20,374 INFO L158 Benchmark]: Boogie Preprocessor took 16.64ms. Allocated memory is still 71.3MB. Free memory was 21.4MB in the beginning and 20.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:50:20,374 INFO L158 Benchmark]: RCFGBuilder took 340.64ms. Allocated memory is still 71.3MB. Free memory was 20.4MB in the beginning and 29.8MB in the end (delta: -9.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2025-03-14 21:50:20,374 INFO L158 Benchmark]: TraceAbstraction took 4889.37ms. Allocated memory was 71.3MB in the beginning and 197.1MB in the end (delta: 125.8MB). Free memory was 28.9MB in the beginning and 40.3MB in the end (delta: -11.5MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. [2025-03-14 21:50:20,376 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.21ms. Allocated memory is still 71.3MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.01ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 23.3MB in the end (delta: 20.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.38ms. Allocated memory is still 71.3MB. Free memory was 23.3MB in the beginning and 21.4MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.64ms. Allocated memory is still 71.3MB. Free memory was 21.4MB in the beginning and 20.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 340.64ms. Allocated memory is still 71.3MB. Free memory was 20.4MB in the beginning and 29.8MB in the end (delta: -9.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4889.37ms. Allocated memory was 71.3MB in the beginning and 197.1MB in the end (delta: 125.8MB). Free memory was 28.9MB in the beginning and 40.3MB in the end (delta: -11.5MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 131 locations, 4 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.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1354 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1354 mSDsluCounter, 1116 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 826 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2500 IncrementalHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 290 mSDtfsCounter, 2500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6426occurred in iteration=6, InterpolantAutomatonStates: 137, 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.3s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 1848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 21:50:20,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...