/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 -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:55,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:55,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:55,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:55,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:55,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:55,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:55,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:55,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:55,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:55,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:55,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:55,904 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:55,904 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:55,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:55,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:55,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:55,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:55,906 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:55,906 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:55,907 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:56,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:56,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:56,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:56,156 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:56,157 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:56,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl [2025-04-26 16:53:56,159 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl' [2025-04-26 16:53:56,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:56,178 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:56,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:56,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:56,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:56,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,218 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:56,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:56,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:56,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:56,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:56,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:56,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:56,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:56,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:56,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/1) ... [2025-04-26 16:53:56,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:56,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:56,302 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 16:53:56,302 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 16:53:56,302 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 16:53:56,302 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:56,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:56,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:56,303 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:53:56,303 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:53:56,303 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:53:56,303 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 16:53:56,303 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 16:53:56,303 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 16:53:56,303 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 16:53:56,303 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 16:53:56,303 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 16:53:56,304 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:56,338 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:56,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:56,431 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:56,431 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:56,439 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:56,440 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:56,440 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:56 BoogieIcfgContainer [2025-04-26 16:53:56,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:56,442 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:56,442 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:56,446 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:56,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:56,447 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:56" (1/2) ... [2025-04-26 16:53:56,448 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f89f225 and model type min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:56, skipping insertion in model container [2025-04-26 16:53:56,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:56,448 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:56" (2/2) ... [2025-04-26 16:53:56,449 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs.bpl [2025-04-26 16:53:56,502 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:53:56,544 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:56,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:56,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:56,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 104 flow [2025-04-26 16:53:56,636 INFO L116 PetriNetUnfolderBase]: 3/33 cut-off events. [2025-04-26 16:53:56,638 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:53:56,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 87 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:53:56,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 104 flow [2025-04-26 16:53:56,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 84 flow [2025-04-26 16:53:56,647 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 33 transitions, 84 flow [2025-04-26 16:53:56,653 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:57,096 WARN L140 AmpleReduction]: Number of pruned transitions: 2470 [2025-04-26 16:53:57,096 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:57,098 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 280 [2025-04-26 16:53:57,098 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:56 [2025-04-26 16:53:57,098 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:986 [2025-04-26 16:53:57,098 WARN L145 AmpleReduction]: Times succ was already a loop node:94 [2025-04-26 16:53:57,098 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:445 [2025-04-26 16:53:57,098 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:57,107 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1323 states, 1321 states have (on average 1.858440575321726) internal successors, (in total 2455), 1322 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,114 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:57,114 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:57,114 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:57,114 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:57,114 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:57,114 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:57,114 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:57,114 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:57,119 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1323 states, 1321 states have (on average 1.858440575321726) internal successors, (in total 2455), 1322 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,168 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 929 [2025-04-26 16:53:57,169 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:57,169 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:57,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:57,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:57,174 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:57,177 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1323 states, 1321 states have (on average 1.858440575321726) internal successors, (in total 2455), 1322 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,199 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 929 [2025-04-26 16:53:57,200 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:57,200 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:57,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:57,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:57,204 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[95] $Ultimate##0-->L30: Formula: (= (select v_A_5 0) v_array_min_4) InVars {A=v_A_5} OutVars{A=v_A_5, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min]" "[96] L30-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_1 0) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1]" [2025-04-26 16:53:57,205 INFO L754 eck$LassoCheckResult]: Loop: "[98] L32-1-->L33: Formula: (< v_computeMinThread1of1ForFork0_i1_5 v_N_5) InVars {computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_5, N=v_N_5} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_5, N=v_N_5} AuxVars[] AssignedVars[]" "[100] L33-->L34: Formula: (= (let ((.cse0 (let ((.cse1 (select v_A_6 v_computeMinThread1of1ForFork0_i1_7))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_6 .cse0) v_array_min_6 .cse0)) v_array_min_5) InVars {A=v_A_6, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_7, array_min=v_array_min_6} OutVars{A=v_A_6, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_7, array_min=v_array_min_5} AuxVars[] AssignedVars[array_min]" "[101] L34-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_10 (+ v_computeMinThread1of1ForFork0_i1_9 1)) InVars {computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_9} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_10} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1]" [2025-04-26 16:53:57,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash 132776, now seen corresponding path program 1 times [2025-04-26 16:53:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453474593] [2025-04-26 16:53:57,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:57,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:57,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:57,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:57,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:57,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash 127170, now seen corresponding path program 1 times [2025-04-26 16:53:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194172690] [2025-04-26 16:53:57,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:57,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:57,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:57,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:57,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:57,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash -339340101, now seen corresponding path program 1 times [2025-04-26 16:53:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440994954] [2025-04-26 16:53:57,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:57,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:57,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,323 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:57,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:57,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:57,605 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:57,606 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:57,606 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:57,606 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:57,606 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:57,606 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,606 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:57,606 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:57,606 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:57,607 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:57,607 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:57,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,939 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:57,943 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:57,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:57,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,975 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:57,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:57,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,999 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:53:57,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,027 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:53:58,028 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:53:58,064 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:58,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:58,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:58,102 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:53:58,102 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:58,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:58,106 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:58,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:53:58,125 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:58,125 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:58,125 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2025-04-26 16:53:58,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:53:58,133 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:58,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:58,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:58,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:58,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:58,220 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:58,223 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1323 states, 1321 states have (on average 1.858440575321726) internal successors, (in total 2455), 1322 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:58,364 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1323 states, 1321 states have (on average 1.858440575321726) internal successors, (in total 2455), 1322 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2759 states and 5501 transitions. Complement of second has 6 states. [2025-04-26 16:53:58,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 16:53:58,374 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:53:58,375 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:58,375 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:53:58,375 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:58,375 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:53:58,375 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:58,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2759 states and 5501 transitions. [2025-04-26 16:53:58,396 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 396 [2025-04-26 16:53:58,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2759 states to 1554 states and 2968 transitions. [2025-04-26 16:53:58,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 697 [2025-04-26 16:53:58,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 947 [2025-04-26 16:53:58,416 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1554 states and 2968 transitions. [2025-04-26 16:53:58,416 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:58,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1554 states and 2968 transitions. [2025-04-26 16:53:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states and 2968 transitions. [2025-04-26 16:53:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1392. [2025-04-26 16:53:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1392 states have (on average 1.9461206896551724) internal successors, (in total 2709), 1391 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2709 transitions. [2025-04-26 16:53:58,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1392 states and 2709 transitions. [2025-04-26 16:53:58,512 INFO L438 stractBuchiCegarLoop]: Abstraction has 1392 states and 2709 transitions. [2025-04-26 16:53:58,512 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:58,512 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1392 states and 2709 transitions. [2025-04-26 16:53:58,518 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 396 [2025-04-26 16:53:58,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:58,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:58,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:58,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:58,519 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1]" "[78] $Ultimate##0-->L44: Formula: (= (select v_A_1 0) v_array_max_1) InVars {A=v_A_1} OutVars{A=v_A_1, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[79] L44-->L46-1: Formula: (= v_computeMaxThread1of1ForFork1_i2_1 0) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_1} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2]" [2025-04-26 16:53:58,519 INFO L754 eck$LassoCheckResult]: Loop: "[81] L46-1-->L47: Formula: (< v_computeMaxThread1of1ForFork1_i2_5 v_N_1) InVars {computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_5, N=v_N_1} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_5, N=v_N_1} AuxVars[] AssignedVars[]" "[83] L47-->L48: Formula: (= (let ((.cse0 (let ((.cse1 (select v_A_2 v_computeMaxThread1of1ForFork1_i2_7))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_3 .cse0) .cse0 v_array_max_3)) v_array_max_2) InVars {A=v_A_2, array_max=v_array_max_3, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_7} OutVars{A=v_A_2, array_max=v_array_max_2, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_7} AuxVars[] AssignedVars[array_max]" "[84] L48-->L46-1: Formula: (= v_computeMaxThread1of1ForFork1_i2_10 (+ v_computeMaxThread1of1ForFork1_i2_9 1)) InVars {computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_9} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_10} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2]" [2025-04-26 16:53:58,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash 4127109, now seen corresponding path program 1 times [2025-04-26 16:53:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522904410] [2025-04-26 16:53:58,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:58,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:58,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:58,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:58,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 110289, now seen corresponding path program 1 times [2025-04-26 16:53:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986275743] [2025-04-26 16:53:58,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:58,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1603266867, now seen corresponding path program 1 times [2025-04-26 16:53:58,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856391098] [2025-04-26 16:53:58,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:58,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:58,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,559 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:58,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:58,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:58,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,758 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:58,758 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:58,758 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:58,758 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:58,758 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:58,759 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,759 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:58,759 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:58,759 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:53:58,759 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:58,759 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:58,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,098 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:59,098 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:59,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:59,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:59,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:59,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:59,116 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:59,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:53:59,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:59,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,135 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-04-26 16:53:59,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,183 INFO L402 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2025-04-26 16:53:59,183 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-04-26 16:53:59,243 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:59,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:53:59,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,252 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:59,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:59,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:59,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:59,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:59,277 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:53:59,277 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:59,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:59,282 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:59,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:59,299 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:59,300 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:59,300 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2025-04-26 16:53:59,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:59,308 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:59,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:59,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:59,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:59,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:59,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:59,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:59,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:59,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:59,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:59,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:59,347 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:59,348 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1392 states and 2709 transitions. cyclomatic complexity: 1492 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,418 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1392 states and 2709 transitions. cyclomatic complexity: 1492. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3264 states and 6602 transitions. Complement of second has 6 states. [2025-04-26 16:53:59,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-04-26 16:53:59,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:53:59,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:53:59,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:53:59,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3264 states and 6602 transitions. [2025-04-26 16:53:59,440 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 168 [2025-04-26 16:53:59,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3264 states to 1746 states and 3411 transitions. [2025-04-26 16:53:59,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2025-04-26 16:53:59,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 638 [2025-04-26 16:53:59,458 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1746 states and 3411 transitions. [2025-04-26 16:53:59,458 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:59,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1746 states and 3411 transitions. [2025-04-26 16:53:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states and 3411 transitions. [2025-04-26 16:53:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1630. [2025-04-26 16:53:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1630 states have (on average 1.9699386503067484) internal successors, (in total 3211), 1629 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 3211 transitions. [2025-04-26 16:53:59,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1630 states and 3211 transitions. [2025-04-26 16:53:59,503 INFO L438 stractBuchiCegarLoop]: Abstraction has 1630 states and 3211 transitions. [2025-04-26 16:53:59,503 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:59,503 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1630 states and 3211 transitions. [2025-04-26 16:53:59,508 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 168 [2025-04-26 16:53:59,508 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:59,508 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:59,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:59,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:59,510 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1]" "[110] L78-->$Ultimate##0: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1]" "[113] L79-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j]" "[89] $Ultimate##0-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 16:53:59,510 INFO L754 eck$LassoCheckResult]: Loop: "[91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A]" "[94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 16:53:59,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 127972274, now seen corresponding path program 1 times [2025-04-26 16:53:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847012068] [2025-04-26 16:53:59,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:59,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:59,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:59,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash 120219, now seen corresponding path program 1 times [2025-04-26 16:53:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407753] [2025-04-26 16:53:59,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:59,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:59,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:59,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:59,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1508853686, now seen corresponding path program 1 times [2025-04-26 16:53:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934752469] [2025-04-26 16:53:59,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:59,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:59,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:59,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:59,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,649 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:59,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:59,650 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:59,650 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:59,650 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:59,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:59,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:59,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:59,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:59,650 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:59,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,786 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:59,787 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:59,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,788 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:59,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:59,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:59,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:59,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:59,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:59,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:59,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:59,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:59,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:59,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:59,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:59,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,844 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:59,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:59,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:59,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:59,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:59,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:59,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:59,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,866 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:59,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:59,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:59,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:59,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:59,881 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:59,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:59,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,892 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:59,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:59,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:59,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:59,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:59,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:59,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:59,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:59,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:59,916 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:53:59,916 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:59,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:59,918 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:59,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:59,921 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:59,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:53:59,938 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:59,938 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:59,938 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2025-04-26 16:53:59,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:59,945 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:59,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:59,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:59,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:59,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:59,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:59,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:59,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:59,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:59,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:59,988 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:59,988 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1630 states and 3211 transitions. cyclomatic complexity: 1745 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,064 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1630 states and 3211 transitions. cyclomatic complexity: 1745. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3954 states and 7782 transitions. Complement of second has 6 states. [2025-04-26 16:54:00,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 16:54:00,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:54:00,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:54:00,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:54:00,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3954 states and 7782 transitions. [2025-04-26 16:54:00,092 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:00,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3954 states to 0 states and 0 transitions. [2025-04-26 16:54:00,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:00,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:00,092 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:00,093 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:00,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:00,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:00,093 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:00,093 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:00,093 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:00,093 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:00,093 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:00,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:00,105 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:00 BoogieIcfgContainer [2025-04-26 16:54:00,105 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:00,106 INFO L158 Benchmark]: Toolchain (without parser) took 3926.95ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 84.5MB in the beginning and 64.9MB in the end (delta: 19.6MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2025-04-26 16:54:00,106 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.83ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 85.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:00,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.43ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:00,107 INFO L158 Benchmark]: Boogie Preprocessor took 26.46ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.7MB in the end (delta: 945.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:00,107 INFO L158 Benchmark]: RCFGBuilder took 190.67ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 71.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:00,107 INFO L158 Benchmark]: BuchiAutomizer took 3662.46ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.3MB in the beginning and 64.9MB in the end (delta: 6.4MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2025-04-26 16:54:00,108 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.83ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 85.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.43ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.46ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.7MB in the end (delta: 945.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 190.67ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 71.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3662.46ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.3MB in the beginning and 64.9MB in the end (delta: 6.4MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 119 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp421 ukn15 mio100 lsp87 div100 bol100 ite100 ukn100 eq157 hnf97 smp100 dnf328 smp53 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 121ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 560, Number of transitions in reduction automaton: 2455, Number of states in reduction automaton: 1323, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:00,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...