/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/adfg_2_x_n_t_indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:34,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:34,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:34,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:34,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:34,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:34,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:34,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:34,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:34,355 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:34,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:34,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:34,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:34,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:34,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:34,357 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:34,357 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:34,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:34,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:34,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:34,600 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:34,600 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:34,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_x_n_t_indep.c.bpl [2025-02-17 22:48:34,601 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_x_n_t_indep.c.bpl' [2025-02-17 22:48:34,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:34,619 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:34,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:34,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:34,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,637 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:34,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:34,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:34,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:34,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:34,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:34,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:34,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:34,683 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-02-17 22:48:34,687 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-02-17 22:48:34,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:34,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:34,708 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:34,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:34,708 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:34,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:34,709 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:34,745 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:34,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:34,814 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:34,815 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:34,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:34,822 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:34,822 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34 BoogieIcfgContainer [2025-02-17 22:48:34,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:34,823 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:34,823 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:34,826 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:34,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,827 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/2) ... [2025-02-17 22:48:34,831 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2240967c and model type adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:34, skipping insertion in model container [2025-02-17 22:48:34,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,832 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34" (2/2) ... [2025-02-17 22:48:34,833 INFO L363 chiAutomizerObserver]: Analyzing ICFG adfg_2_x_n_t_indep.c.bpl [2025-02-17 22:48:34,879 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:34,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 31 transitions, 76 flow [2025-02-17 22:48:34,940 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-02-17 22:48:34,942 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:34,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 6/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2025-02-17 22:48:34,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 31 transitions, 76 flow [2025-02-17 22:48:34,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 27 transitions, 66 flow [2025-02-17 22:48:34,954 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:35,042 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:35,042 INFO L101 AmpleReduction]: Number of pruned transitions: 31, Number of non-trivial ample sets: 48 [2025-02-17 22:48:35,042 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 54 [2025-02-17 22:48:35,048 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:35,048 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:35,048 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:35,048 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:35,048 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:35,048 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:35,048 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:35,048 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:35,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,061 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2025-02-17 22:48:35,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:35,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:35,064 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:35,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,067 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2025-02-17 22:48:35,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:35,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:35,071 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L26: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L26-->L34-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" [2025-02-17 22:48:35,072 INFO L754 eck$LassoCheckResult]: Loop: "[81] L34-2-->L34: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[83] L34-->L36: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[85] L36-->L34-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 1 times [2025-02-17 22:48:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431041306] [2025-02-17 22:48:35,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 1 times [2025-02-17 22:48:35,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115070853] [2025-02-17 22:48:35,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -471956722, now seen corresponding path program 1 times [2025-02-17 22:48:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610612676] [2025-02-17 22:48:35,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:35,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:35,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:35,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:35,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,270 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:35,271 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:35,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:35,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:35,272 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:35,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:35,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:35,273 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:48:35,273 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:35,274 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:35,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,405 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:35,406 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,409 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-02-17 22:48:35,410 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-02-17 22:48:35,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:35,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:35,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,434 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-02-17 22:48:35,435 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-02-17 22:48:35,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:35,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:35,594 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:35,600 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-02-17 22:48:35,600 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:35,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:35,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:35,601 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:35,601 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:35,601 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,601 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:35,601 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:35,601 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:48:35,601 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:35,601 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:35,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,663 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:35,666 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:35,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,671 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-02-17 22:48:35,673 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-02-17 22:48:35,673 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-02-17 22:48:35,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:35,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:35,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:35,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:35,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:35,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:35,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:35,751 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-02-17 22:48:35,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,753 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-02-17 22:48:35,754 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-02-17 22:48:35,755 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-02-17 22:48:35,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:35,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:35,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:35,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:35,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:35,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:35,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:35,792 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-02-17 22:48:35,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,794 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-02-17 22:48:35,795 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-02-17 22:48:35,796 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-02-17 22:48:35,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:35,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:35,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:35,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:35,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:35,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:35,818 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:35,824 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:35,825 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:35,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,828 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-02-17 22:48:35,829 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-02-17 22:48:35,830 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:35,842 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:35,842 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:35,843 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1, t1) = 2*n1 - 2*x1 + 1*t1 Supporting invariants [1*t1 - 1 >= 0] [2025-02-17 22:48:35,849 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-02-17 22:48:35,856 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:35,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:35,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:35,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:35,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:35,926 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:35,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:35,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-02-17 22:48:35,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,091 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 69 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 273 states and 514 transitions. Complement of second has 7 states. [2025-02-17 22:48:36,092 INFO L141 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-02-17 22:48:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-17 22:48:36,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:48:36,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:48:36,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:48:36,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 514 transitions. [2025-02-17 22:48:36,119 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 112 [2025-02-17 22:48:36,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 209 states and 400 transitions. [2025-02-17 22:48:36,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2025-02-17 22:48:36,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2025-02-17 22:48:36,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 400 transitions. [2025-02-17 22:48:36,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 400 transitions. [2025-02-17 22:48:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 400 transitions. [2025-02-17 22:48:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 113. [2025-02-17 22:48:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 2.0088495575221237) internal successors, (227), 112 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 227 transitions. [2025-02-17 22:48:36,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 227 transitions. [2025-02-17 22:48:36,159 INFO L432 stractBuchiCegarLoop]: Abstraction has 113 states and 227 transitions. [2025-02-17 22:48:36,159 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:36,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 227 transitions. [2025-02-17 22:48:36,163 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 52 [2025-02-17 22:48:36,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:36,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,163 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L30: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[79] L30-->L34-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" [2025-02-17 22:48:36,163 INFO L754 eck$LassoCheckResult]: Loop: "[81] L34-2-->L34: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[84] L34-->L40: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L40-->L34-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 128357, now seen corresponding path program 1 times [2025-02-17 22:48:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709889847] [2025-02-17 22:48:36,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 1 times [2025-02-17 22:48:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777884508] [2025-02-17 22:48:36,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash -471003378, now seen corresponding path program 1 times [2025-02-17 22:48:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835969484] [2025-02-17 22:48:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:36,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:36,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:36,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:36,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,221 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,221 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,221 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,221 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,221 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:36,221 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:48:36,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,222 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,264 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,264 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:36,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,266 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-02-17 22:48:36,268 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-02-17 22:48:36,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,284 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:36,285 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:36,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:36,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,293 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-02-17 22:48:36,294 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-02-17 22:48:36,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,312 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:36,312 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:36,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:48:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,320 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-02-17 22:48:36,321 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-02-17 22:48:36,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,340 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-02-17 22:48:36,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,345 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-02-17 22:48:36,348 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-02-17 22:48:36,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:36,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,457 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:36,462 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-02-17 22:48:36,462 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,462 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,462 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,463 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,463 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:36,463 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,463 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:48:36,463 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,463 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,502 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,502 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:36,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,536 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-02-17 22:48:36,537 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-02-17 22:48:36,538 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-02-17 22:48:36,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:36,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:48:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,561 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-02-17 22:48:36,563 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-02-17 22:48:36,564 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-02-17 22:48:36,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:36,584 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-02-17 22:48:36,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,586 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-02-17 22:48:36,588 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-02-17 22:48:36,589 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-02-17 22:48:36,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,606 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:36,611 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:36,611 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:36,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,613 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-02-17 22:48:36,614 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-02-17 22:48:36,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:36,625 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:36,625 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:36,625 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1) = 2*n1 - 2*x1 + 1 Supporting invariants [-1*t1 - 1 >= 0] [2025-02-17 22:48:36,631 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-02-17 22:48:36,636 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:36,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,679 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,712 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-02-17 22:48:36,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 227 transitions. cyclomatic complexity: 130 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 227 transitions. cyclomatic complexity: 130. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 292 states and 574 transitions. Complement of second has 7 states. [2025-02-17 22:48:36,777 INFO L141 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-02-17 22:48:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-17 22:48:36,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:48:36,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:48:36,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:48:36,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 574 transitions. [2025-02-17 22:48:36,786 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 116 [2025-02-17 22:48:36,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 253 states and 494 transitions. [2025-02-17 22:48:36,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2025-02-17 22:48:36,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2025-02-17 22:48:36,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 494 transitions. [2025-02-17 22:48:36,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 253 states and 494 transitions. [2025-02-17 22:48:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 494 transitions. [2025-02-17 22:48:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 157. [2025-02-17 22:48:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.038216560509554) internal successors, (320), 156 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 320 transitions. [2025-02-17 22:48:36,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 320 transitions. [2025-02-17 22:48:36,798 INFO L432 stractBuchiCegarLoop]: Abstraction has 157 states and 320 transitions. [2025-02-17 22:48:36,798 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:36,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 320 transitions. [2025-02-17 22:48:36,799 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 52 [2025-02-17 22:48:36,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:36,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,799 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L26: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L26-->L34-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[81] L34-2-->L34: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[84] L34-->L40: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,799 INFO L754 eck$LassoCheckResult]: Loop: "[86] L40-->L34-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" "[81] L34-2-->L34: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[84] L34-->L40: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,800 INFO L85 PathProgramCache]: Analyzing trace with hash 123322920, now seen corresponding path program 1 times [2025-02-17 22:48:36,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347324375] [2025-02-17 22:48:36,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:36,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:36,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347324375] [2025-02-17 22:48:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347324375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:36,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:48:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948322157] [2025-02-17 22:48:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:36,832 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:36,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 115032, now seen corresponding path program 2 times [2025-02-17 22:48:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601066495] [2025-02-17 22:48:36,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:36,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:36,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:36,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:36,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:36,863 INFO L87 Difference]: Start difference. First operand 157 states and 320 transitions. cyclomatic complexity: 185 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:36,885 INFO L93 Difference]: Finished difference Result 165 states and 298 transitions. [2025-02-17 22:48:36,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 298 transitions. [2025-02-17 22:48:36,891 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 48 [2025-02-17 22:48:36,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 146 states and 267 transitions. [2025-02-17 22:48:36,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-02-17 22:48:36,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2025-02-17 22:48:36,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 267 transitions. [2025-02-17 22:48:36,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 267 transitions. [2025-02-17 22:48:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 267 transitions. [2025-02-17 22:48:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2025-02-17 22:48:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.8333333333333333) internal successors, (231), 125 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 231 transitions. [2025-02-17 22:48:36,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 231 transitions. [2025-02-17 22:48:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:36,903 INFO L432 stractBuchiCegarLoop]: Abstraction has 126 states and 231 transitions. [2025-02-17 22:48:36,903 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:36,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 231 transitions. [2025-02-17 22:48:36,904 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 48 [2025-02-17 22:48:36,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:48:36,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,904 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L30: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[79] L30-->L34-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" "[81] L34-2-->L34: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,905 INFO L754 eck$LassoCheckResult]: Loop: "[83] L34-->L36: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[85] L36-->L34-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[81] L34-2-->L34: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash 3979148, now seen corresponding path program 1 times [2025-02-17 22:48:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656259947] [2025-02-17 22:48:36,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:36,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:36,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:36,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:36,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash 112270, now seen corresponding path program 2 times [2025-02-17 22:48:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115254221] [2025-02-17 22:48:36,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:36,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:36,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1716203741, now seen corresponding path program 1 times [2025-02-17 22:48:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462446556] [2025-02-17 22:48:36,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:36,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:36,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:36,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462446556] [2025-02-17 22:48:36,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462446556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:36,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:36,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:36,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479582247] [2025-02-17 22:48:36,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:36,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:36,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:36,952 INFO L87 Difference]: Start difference. First operand 126 states and 231 transitions. cyclomatic complexity: 127 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:36,973 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-02-17 22:48:36,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 169 transitions. [2025-02-17 22:48:36,974 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-02-17 22:48:36,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 85 states and 142 transitions. [2025-02-17 22:48:36,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-02-17 22:48:36,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-02-17 22:48:36,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 142 transitions. [2025-02-17 22:48:36,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 142 transitions. [2025-02-17 22:48:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 142 transitions. [2025-02-17 22:48:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-17 22:48:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 84 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 142 transitions. [2025-02-17 22:48:36,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 142 transitions. [2025-02-17 22:48:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:36,983 INFO L432 stractBuchiCegarLoop]: Abstraction has 85 states and 142 transitions. [2025-02-17 22:48:36,983 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:36,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 142 transitions. [2025-02-17 22:48:36,984 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-02-17 22:48:36,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:36,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,985 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L26: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L26-->L34-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[80] L34-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[87] $Ultimate##0-->L50: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[89] L50-->L58-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" [2025-02-17 22:48:36,985 INFO L754 eck$LassoCheckResult]: Loop: "[92] L58-2-->L58: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[94] L58-->L60: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[96] L60-->L58-2: Formula: (= (+ v_x2_3 v_t2_1) v_x2_2) InVars {t2=v_t2_1, x2=v_x2_3} OutVars{t2=v_t2_1, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:36,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1715190306, now seen corresponding path program 1 times [2025-02-17 22:48:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063936092] [2025-02-17 22:48:36,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:36,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:36,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash 121213, now seen corresponding path program 1 times [2025-02-17 22:48:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781444488] [2025-02-17 22:48:37,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,005 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-02-17 22:48:37,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-17 22:48:37,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash 8576956, now seen corresponding path program 1 times [2025-02-17 22:48:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885843407] [2025-02-17 22:48:37,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:37,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:37,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:37,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:37,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,093 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,093 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,093 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,093 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,093 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:37,093 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,093 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,093 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,093 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:48:37,093 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,093 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,168 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,168 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,175 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-02-17 22:48:37,178 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-02-17 22:48:37,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,197 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:37,198 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n1=0, x1=1} Honda state: {n1=0, x1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:37,203 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-02-17 22:48:37,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,205 INFO L229 MonitoredProcess]: Starting monitored process 17 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-02-17 22:48:37,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:48:37,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,218 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:37,219 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:37,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:48:37,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,227 INFO L229 MonitoredProcess]: Starting monitored process 18 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-02-17 22:48:37,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:48:37,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-17 22:48:37,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,254 INFO L229 MonitoredProcess]: Starting monitored process 19 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-02-17 22:48:37,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:48:37,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:37,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,415 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:37,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:48:37,421 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,421 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,421 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,421 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,421 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:37,421 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,421 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,421 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,421 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:48:37,421 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,421 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,510 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,510 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:37,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,512 INFO L229 MonitoredProcess]: Starting monitored process 20 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-02-17 22:48:37,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:48:37,520 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-02-17 22:48:37,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:37,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:48:37,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,544 INFO L229 MonitoredProcess]: Starting monitored process 21 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-02-17 22:48:37,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:48:37,547 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-02-17 22:48:37,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:37,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:48:37,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,573 INFO L229 MonitoredProcess]: Starting monitored process 22 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-02-17 22:48:37,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:48:37,574 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-02-17 22:48:37,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:37,595 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:37,595 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:37,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,597 INFO L229 MonitoredProcess]: Starting monitored process 23 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-02-17 22:48:37,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:48:37,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:37,614 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:37,614 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:37,614 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, t2, x2) = 2*n2 + 1*t2 - 2*x2 Supporting invariants [1*t2 - 1 >= 0] [2025-02-17 22:48:37,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:48:37,626 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:37,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:37,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:37,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:37,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:37,673 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:37,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:37,707 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-02-17 22:48:37,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 142 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,747 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 142 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 138 states and 241 transitions. Complement of second has 6 states. [2025-02-17 22:48:37,751 INFO L141 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-02-17 22:48:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-02-17 22:48:37,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:37,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-17 22:48:37,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-17 22:48:37,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 241 transitions. [2025-02-17 22:48:37,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-17 22:48:37,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 38 states and 60 transitions. [2025-02-17 22:48:37,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-17 22:48:37,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-17 22:48:37,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 60 transitions. [2025-02-17 22:48:37,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:37,755 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 60 transitions. [2025-02-17 22:48:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 60 transitions. [2025-02-17 22:48:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-17 22:48:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. [2025-02-17 22:48:37,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 60 transitions. [2025-02-17 22:48:37,759 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 60 transitions. [2025-02-17 22:48:37,759 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:48:37,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 60 transitions. [2025-02-17 22:48:37,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-17 22:48:37,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:37,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:37,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:37,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:37,760 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L30: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[79] L30-->L34-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" "[80] L34-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L15-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[88] $Ultimate##0-->L54: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[90] L54-->L58-2: Formula: (= (+ v_t2_4 1) 0) InVars {} OutVars{t2=v_t2_4} AuxVars[] AssignedVars[t2]" [2025-02-17 22:48:37,760 INFO L754 eck$LassoCheckResult]: Loop: "[92] L58-2-->L58: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[95] L58-->L64: Formula: (< v_b_6 1) InVars {b=v_b_6} OutVars{b=v_b_6} AuxVars[] AssignedVars[]" "[97] L64-->L58-2: Formula: (= v_x2_5 (+ v_x2_4 v_t2_2)) InVars {t2=v_t2_2, x2=v_x2_5} OutVars{t2=v_t2_2, x2=v_x2_4} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:37,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1663644126, now seen corresponding path program 1 times [2025-02-17 22:48:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141833355] [2025-02-17 22:48:37,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash 121245, now seen corresponding path program 1 times [2025-02-17 22:48:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473607538] [2025-02-17 22:48:37,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1994437668, now seen corresponding path program 1 times [2025-02-17 22:48:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441832664] [2025-02-17 22:48:37,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:37,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:37,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:37,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,850 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,850 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,850 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,850 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,850 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:37,850 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,850 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,850 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,850 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:48:37,850 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,850 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,913 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,913 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:37,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,915 INFO L229 MonitoredProcess]: Starting monitored process 24 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-02-17 22:48:37,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:48:37,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,917 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,939 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:37,939 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n1=0, x1=1} Honda state: {n1=0, x1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:37,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:48:37,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,947 INFO L229 MonitoredProcess]: Starting monitored process 25 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-02-17 22:48:37,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:48:37,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,965 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:37,965 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:37,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-17 22:48:37,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,972 INFO L229 MonitoredProcess]: Starting monitored process 26 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-02-17 22:48:37,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:48:37,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,992 INFO L229 MonitoredProcess]: Starting monitored process 27 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-02-17 22:48:37,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:48:37,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:37,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:38,098 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:38,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:48:38,103 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:38,103 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:38,103 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:38,103 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:38,103 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:38,103 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,103 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:38,103 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:38,103 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:48:38,103 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:38,103 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:38,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,162 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:38,163 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:38,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,168 INFO L229 MonitoredProcess]: Starting monitored process 28 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-02-17 22:48:38,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:48:38,170 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-02-17 22:48:38,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:38,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:38,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:38,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:38,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:38,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:38,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:38,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-17 22:48:38,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,190 INFO L229 MonitoredProcess]: Starting monitored process 29 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-02-17 22:48:38,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:48:38,193 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-02-17 22:48:38,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:38,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:38,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:38,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:38,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:38,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:38,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:38,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,213 INFO L229 MonitoredProcess]: Starting monitored process 30 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-02-17 22:48:38,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-17 22:48:38,215 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-02-17 22:48:38,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:38,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:38,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:38,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:38,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:38,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:38,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:38,241 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:48:38,241 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:38,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,243 INFO L229 MonitoredProcess]: Starting monitored process 31 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-02-17 22:48:38,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-17 22:48:38,245 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:38,257 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:38,257 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:38,257 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, x2) = 2*n2 - 2*x2 + 1 Supporting invariants [-1*t2 - 1 >= 0] [2025-02-17 22:48:38,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-17 22:48:38,266 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:38,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:38,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:38,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:38,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:38,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:38,328 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-02-17 22:48:38,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 60 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 60 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 132 transitions. Complement of second has 6 states. [2025-02-17 22:48:38,360 INFO L141 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-02-17 22:48:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-02-17 22:48:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-17 22:48:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-17 22:48:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 132 transitions. [2025-02-17 22:48:38,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:38,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2025-02-17 22:48:38,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:38,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:38,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:38,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:38,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:38,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:38,362 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:38,362 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:48:38,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:38,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:38,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:38,371 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:38 BoogieIcfgContainer [2025-02-17 22:48:38,371 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:38,371 INFO L158 Benchmark]: Toolchain (without parser) took 3752.17ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.2MB in the beginning and 27.3MB in the end (delta: 57.9MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. [2025-02-17 22:48:38,372 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:38,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.08ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:38,372 INFO L158 Benchmark]: Boogie Preprocessor took 11.07ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.3MB in the end (delta: 647.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:38,372 INFO L158 Benchmark]: RCFGBuilder took 170.12ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:38,372 INFO L158 Benchmark]: BuchiAutomizer took 3548.26ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.1MB in the beginning and 27.3MB in the end (delta: 46.8MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2025-02-17 22:48:38,373 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.08ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 11.07ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.3MB in the end (delta: 647.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 170.12ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3548.26ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.1MB in the beginning and 27.3MB in the end (delta: 46.8MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 2 * n1 + t1 and consists of 4 locations. One deterministic module has affine ranking function -2 * x1 + 2 * n1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n2 + -2 * x2 + t2 and consists of 4 locations. One deterministic module has affine ranking function 2 * n2 + -2 * x2 + 1 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 212 StatesRemovedByMinimization, 3 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 188 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax100 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 77ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 139, Trivial Ample Sets caused by loops: 54, Number of non-trivial ample sets: 48, Number of pruned transitions: 31, Number of transitions in reduction automaton: 126, Number of states in reduction automaton: 69, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:48:38,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-17 22:48:38,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:48:38,787 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...