/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:30,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:30,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:30,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:30,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:30,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:30,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:30,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:30,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:30,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:30,773 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:30,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:30,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:30,774 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:30,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:30,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:30,775 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:30,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:30,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:30,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:30,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:30,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:30,775 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:30,775 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:30,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:30,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:30,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:30,990 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:30,992 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:30,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl [2025-04-26 16:21:30,995 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl' [2025-04-26 16:21:31,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:31,016 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:31,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:31,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:31,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:31,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,050 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:31,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:31,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:31,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:31,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:31,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,060 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:31,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:31,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:31,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:31,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,094 INFO L229 MonitoredProcess]: Starting monitored process 1 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:21:31,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:31,116 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 16:21:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 16:21:31,117 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 16:21:31,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:31,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:31,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:21:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:21:31,117 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:21:31,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 16:21:31,117 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 16:21:31,117 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 16:21:31,118 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:21:31,157 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:31,158 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:31,245 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:31,245 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:31,265 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:31,265 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:21:31,266 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:31 BoogieIcfgContainer [2025-04-26 16:21:31,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:31,267 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:31,267 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:31,272 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:31,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:31,273 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/2) ... [2025-04-26 16:21:31,274 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f3d02c0 and model type min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:31, skipping insertion in model container [2025-04-26 16:21:31,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:31,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:31" (2/2) ... [2025-04-26 16:21:31,275 INFO L376 chiAutomizerObserver]: Analyzing ICFG min2-max2-sample.bpl [2025-04-26 16:21:31,350 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:21:31,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 130 flow [2025-04-26 16:21:31,417 INFO L116 PetriNetUnfolderBase]: 5/39 cut-off events. [2025-04-26 16:21:31,419 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:21:31,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 39 events. 5/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 16:21:31,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 130 flow [2025-04-26 16:21:31,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 105 flow [2025-04-26 16:21:31,426 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 50 places, 39 transitions, 105 flow [2025-04-26 16:21:31,435 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:31,435 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:31,435 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:31,435 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:31,435 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:31,435 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:31,435 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:31,436 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:31,437 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:32,053 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2025-04-26 16:21:32,053 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:32,053 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:32,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:32,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:32,057 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:32,057 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 6228 states, but on-demand construction may add more states [2025-04-26 16:21:32,159 INFO L131 ngComponentsAnalysis]: Automaton has 1664 accepting balls. 5544 [2025-04-26 16:21:32,159 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:32,159 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:32,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:32,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:32,166 INFO L752 eck$LassoCheckResult]: Stem: "[98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0]" "[84] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min]" "[85] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1]" [2025-04-26 16:21:32,167 INFO L754 eck$LassoCheckResult]: Loop: "[87] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[]" "[89] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1]" [2025-04-26 16:21:32,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,173 INFO L85 PathProgramCache]: Analyzing trace with hash 126658, now seen corresponding path program 1 times [2025-04-26 16:21:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:32,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749394383] [2025-04-26 16:21:32,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:32,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:32,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:32,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,235 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:32,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:32,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:32,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:32,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2025-04-26 16:21:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:32,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198113780] [2025-04-26 16:21:32,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:32,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:32,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:32,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:32,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:32,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:32,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:32,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash 121721124, now seen corresponding path program 1 times [2025-04-26 16:21:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:32,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627733328] [2025-04-26 16:21:32,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:32,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:32,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:32,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:32,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:32,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:32,428 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:32,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:32,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:32,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:32,429 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:32,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:32,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:32,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:32,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:32,430 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:32,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,595 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:32,598 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:32,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,602 INFO L229 MonitoredProcess]: Starting monitored process 2 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:21:32,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:32,605 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:21:32,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:32,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:32,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:32,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:32,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:32,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:32,658 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:32,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:32,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,670 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:21:32,672 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:21:32,676 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:21:32,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:32,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:32,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:32,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:32,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:32,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:32,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:32,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:32,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:32,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,719 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:21:32,722 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:21:32,725 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:21:32,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:32,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:32,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:32,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:32,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:32,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:32,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:32,777 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:32,778 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,784 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:21:32,786 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:21:32,786 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:32,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:32,804 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:32,804 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:32,805 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2025-04-26 16:21:32,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:21:32,814 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:32,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:32,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:32,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:32,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:32,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:32,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:32,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:32,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:32,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:32,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:32,877 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:21:32,898 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:21:32,901 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 6228 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:21:33,493 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 6228 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 24650 states and 133431 transitions. Complement of second has 8 states. [2025-04-26 16:21:33,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:21:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-26 16:21:33,508 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:21:33,509 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:33,509 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:21:33,509 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:33,509 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 154 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:21:33,509 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:33,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24650 states and 133431 transitions. [2025-04-26 16:21:34,148 INFO L131 ngComponentsAnalysis]: Automaton has 2859 accepting balls. 8476 [2025-04-26 16:21:34,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24650 states to 20100 states and 110108 transitions. [2025-04-26 16:21:34,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10941 [2025-04-26 16:21:34,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15103 [2025-04-26 16:21:34,653 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20100 states and 110108 transitions. [2025-04-26 16:21:34,653 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:34,653 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20100 states and 110108 transitions. [2025-04-26 16:21:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20100 states and 110108 transitions. [2025-04-26 16:21:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20100 to 15022. [2025-04-26 16:21:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15022 states, 15022 states have (on average 5.750432698708561) internal successors, (in total 86383), 15021 states have internal predecessors, (86383), 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:21:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15022 states to 15022 states and 86383 transitions. [2025-04-26 16:21:35,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15022 states and 86383 transitions. [2025-04-26 16:21:35,404 INFO L438 stractBuchiCegarLoop]: Abstraction has 15022 states and 86383 transitions. [2025-04-26 16:21:35,404 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:35,404 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15022 states and 86383 transitions. [2025-04-26 16:21:35,568 INFO L131 ngComponentsAnalysis]: Automaton has 2571 accepting balls. 7722 [2025-04-26 16:21:35,569 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:35,569 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:35,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:35,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:35,571 INFO L752 eck$LassoCheckResult]: Stem: "[98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0]" "[101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1]" "[90] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min]" "[91] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1]" [2025-04-26 16:21:35,571 INFO L754 eck$LassoCheckResult]: Loop: "[93] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[]" "[95] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1]" [2025-04-26 16:21:35,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 3942981, now seen corresponding path program 1 times [2025-04-26 16:21:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:35,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6239874] [2025-04-26 16:21:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:35,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:35,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:35,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:35,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:35,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:35,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:35,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 16:21:35,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:35,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265527103] [2025-04-26 16:21:35,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:35,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:35,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:35,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:35,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:35,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:35,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:35,590 INFO L85 PathProgramCache]: Analyzing trace with hash -505759577, now seen corresponding path program 1 times [2025-04-26 16:21:35,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:35,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969109136] [2025-04-26 16:21:35,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:35,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:35,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:35,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:35,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:35,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:35,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:35,675 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:35,676 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:35,676 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:35,676 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:35,676 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:35,676 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:35,676 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:35,676 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:35,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:35,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:35,676 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:35,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:35,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:35,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:35,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:35,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:35,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:35,806 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:35,806 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:35,808 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:21:35,810 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:21:35,811 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:21:35,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:35,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:35,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:35,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:35,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:35,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:35,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:35,836 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:35,836 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:35,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:35,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:35,838 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:21:35,840 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:21:35,843 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:35,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:35,860 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:35,860 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:35,860 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2025-04-26 16:21:35,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:35,869 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:35,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:35,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:35,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:35,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:35,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:35,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:35,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:35,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:35,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:35,904 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:35,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:35,920 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:21:35,921 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:21:35,921 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15022 states and 86383 transitions. cyclomatic complexity: 74736 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:21:36,648 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15022 states and 86383 transitions. cyclomatic complexity: 74736. 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 31151 states and 178931 transitions. Complement of second has 8 states. [2025-04-26 16:21:36,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:36,649 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:21:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-04-26 16:21:36,649 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:21:36,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:36,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:21:36,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:36,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:21:36,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:36,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31151 states and 178931 transitions. [2025-04-26 16:21:37,262 INFO L131 ngComponentsAnalysis]: Automaton has 3312 accepting balls. 8628 [2025-04-26 16:21:37,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31151 states to 26847 states and 156510 transitions. [2025-04-26 16:21:37,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12773 [2025-04-26 16:21:37,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16757 [2025-04-26 16:21:37,760 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26847 states and 156510 transitions. [2025-04-26 16:21:37,760 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:37,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26847 states and 156510 transitions. [2025-04-26 16:21:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26847 states and 156510 transitions. [2025-04-26 16:21:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26847 to 14609. [2025-04-26 16:21:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14609 states, 14609 states have (on average 6.11171195838182) internal successors, (in total 89286), 14608 states have internal predecessors, (89286), 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:21:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14609 states to 14609 states and 89286 transitions. [2025-04-26 16:21:38,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14609 states and 89286 transitions. [2025-04-26 16:21:38,463 INFO L438 stractBuchiCegarLoop]: Abstraction has 14609 states and 89286 transitions. [2025-04-26 16:21:38,463 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:38,463 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14609 states and 89286 transitions. [2025-04-26 16:21:38,607 INFO L131 ngComponentsAnalysis]: Automaton has 2130 accepting balls. 5546 [2025-04-26 16:21:38,607 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:38,607 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:38,608 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:38,608 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:38,609 INFO L752 eck$LassoCheckResult]: Stem: "[98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0]" "[101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1]" "[104] L70-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork2_thidvar2_2 3) (= v_computeMaxThread1of1ForFork2_thidvar0_2 3) (= v_computeMaxThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{computeMaxThread1of1ForFork2_y=v_computeMaxThread1of1ForFork2_y_2, computeMaxThread1of1ForFork2_thidvar2=v_computeMaxThread1of1ForFork2_thidvar2_2, computeMaxThread1of1ForFork2_thidvar1=v_computeMaxThread1of1ForFork2_thidvar1_2, computeMaxThread1of1ForFork2_thidvar0=v_computeMaxThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork2_y, computeMaxThread1of1ForFork2_thidvar2, computeMaxThread1of1ForFork2_thidvar1, computeMaxThread1of1ForFork2_thidvar0]" "[107] L71-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork3_thidvar0_2 4) (= v_computeMaxThread1of1ForFork3_thidvar3_2 4) (= v_computeMaxThread1of1ForFork3_thidvar2_2 4) (= v_computeMaxThread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{computeMaxThread1of1ForFork3_thidvar3=v_computeMaxThread1of1ForFork3_thidvar3_2, computeMaxThread1of1ForFork3_y=v_computeMaxThread1of1ForFork3_y_2, computeMaxThread1of1ForFork3_thidvar1=v_computeMaxThread1of1ForFork3_thidvar1_2, computeMaxThread1of1ForFork3_thidvar2=v_computeMaxThread1of1ForFork3_thidvar2_2, computeMaxThread1of1ForFork3_thidvar0=v_computeMaxThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork3_thidvar3, computeMaxThread1of1ForFork3_y, computeMaxThread1of1ForFork3_thidvar1, computeMaxThread1of1ForFork3_thidvar2, computeMaxThread1of1ForFork3_thidvar0]" "[110] L72-->L60: Formula: (and (= 5 v_sampleThread1of1ForFork4_thidvar0_2) (= 5 v_sampleThread1of1ForFork4_thidvar1_2) (= 5 v_sampleThread1of1ForFork4_thidvar2_2) (= 5 v_sampleThread1of1ForFork4_thidvar4_2) (= 5 v_sampleThread1of1ForFork4_thidvar3_2)) InVars {} OutVars{sampleThread1of1ForFork4_thidvar4=v_sampleThread1of1ForFork4_thidvar4_2, sampleThread1of1ForFork4_thidvar3=v_sampleThread1of1ForFork4_thidvar3_2, sampleThread1of1ForFork4_thidvar2=v_sampleThread1of1ForFork4_thidvar2_2, sampleThread1of1ForFork4_thidvar1=v_sampleThread1of1ForFork4_thidvar1_2, sampleThread1of1ForFork4_thidvar0=v_sampleThread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[sampleThread1of1ForFork4_thidvar4, sampleThread1of1ForFork4_thidvar3, sampleThread1of1ForFork4_thidvar2, sampleThread1of1ForFork4_thidvar1, sampleThread1of1ForFork4_thidvar0]" [2025-04-26 16:21:38,609 INFO L754 eck$LassoCheckResult]: Loop: "[82] L60-->L62: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3)) InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3} OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3} AuxVars[] AssignedVars[min_samples]" "[83] L62-->L60: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {array_max=v_array_max_6, i2=v_i2_7, max_samples=v_max_samples_2} OutVars{array_max=v_array_max_6, i2=v_i2_7, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples]" [2025-04-26 16:21:38,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash 122246471, now seen corresponding path program 1 times [2025-04-26 16:21:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:38,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037880484] [2025-04-26 16:21:38,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:38,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:38,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:38,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:38,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:38,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:38,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:38,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash 3586, now seen corresponding path program 1 times [2025-04-26 16:21:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:38,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484688046] [2025-04-26 16:21:38,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:38,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:38,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:38,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:38,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:38,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:38,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:38,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1514744264, now seen corresponding path program 1 times [2025-04-26 16:21:38,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:38,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312456062] [2025-04-26 16:21:38,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:38,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:38,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:38,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:38,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:38,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:38,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:38,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:38,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:38,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:38,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:38,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:38,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:38,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,814 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:38 BoogieIcfgContainer [2025-04-26 16:21:38,814 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:38,815 INFO L158 Benchmark]: Toolchain (without parser) took 7798.48ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 94.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 720.8MB. Max. memory is 8.0GB. [2025-04-26 16:21:38,815 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 167.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:38,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.56ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:38,815 INFO L158 Benchmark]: Boogie Preprocessor took 16.32ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 91.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:38,815 INFO L158 Benchmark]: RCFGBuilder took 196.26ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 81.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:38,816 INFO L158 Benchmark]: BuchiAutomizer took 7546.78ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 81.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 708.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:38,817 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.79ms. Allocated memory is still 167.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.56ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.32ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 91.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 196.26ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 81.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 7546.78ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 81.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 708.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 1.4s AutomataMinimizationTime, 2 MinimizatonAttempts, 17316 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 2.0s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 94 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf100 lsp132 ukn54 mio100 lsp58 div100 bol100 ite100 ukn100 eq160 hnf100 smp100 dnf162 smp57 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. The remainder module has 14609 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 60]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L69] FORK 0 fork 1 computeMin(); [L70] FORK 0 fork 2, 2 computeMin(); [L71] FORK 0 fork 3, 3, 3 computeMax(); [L72] FORK 0 fork 4, 4, 4, 4 computeMax(); [L73] FORK 0 fork 5, 5, 5, 5, 5 sample(); Loop: [L61] min_samples[i1 - 1] := array_min; [L62] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 60]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L69] FORK 0 fork 1 computeMin(); [L70] FORK 0 fork 2, 2 computeMin(); [L71] FORK 0 fork 3, 3, 3 computeMax(); [L72] FORK 0 fork 4, 4, 4, 4 computeMax(); [L73] FORK 0 fork 5, 5, 5, 5, 5 sample(); Loop: [L61] min_samples[i1 - 1] := array_min; [L62] max_samples[i2 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:21:38,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...