/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/3_thr/seq_loops_indep_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:05,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:05,352 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:49:05,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:05,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:05,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:05,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:05,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:05,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:05,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:05,378 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:05,378 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:05,378 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:05,378 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:05,378 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:05,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:05,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:05,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:05,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:05,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:05,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:05,380 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:05,380 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:49:05,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:05,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:05,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:05,621 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:05,621 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:05,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/seq_loops_indep_3.c.bpl [2025-02-17 22:49:05,622 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/seq_loops_indep_3.c.bpl' [2025-02-17 22:49:05,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:05,638 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:05,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:05,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:05,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:05,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,656 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:05,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:05,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:05,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:05,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:05,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:05,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:05,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:05,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:05,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/1) ... [2025-02-17 22:49:05,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,698 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:49:05,701 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:49:05,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:05,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:05,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:05,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:05,724 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:49:05,758 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:05,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:05,822 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:05,823 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:05,831 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:05,831 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:05,832 INFO L201 PluginConnector]: Adding new model seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:05 BoogieIcfgContainer [2025-02-17 22:49:05,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:05,833 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:05,833 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:05,838 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:05,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:05,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:05" (1/2) ... [2025-02-17 22:49:05,840 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6160d1bb and model type seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:05, skipping insertion in model container [2025-02-17 22:49:05,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:05,840 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:05" (2/2) ... [2025-02-17 22:49:05,842 INFO L363 chiAutomizerObserver]: Analyzing ICFG seq_loops_indep_3.c.bpl [2025-02-17 22:49:05,900 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:49:05,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:49:05,956 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-02-17 22:49:05,959 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:49:05,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-17 22:49:05,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:49:05,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 74 flow [2025-02-17 22:49:05,973 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:06,226 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:06,226 INFO L101 AmpleReduction]: Number of pruned transitions: 110, Number of non-trivial ample sets: 384 [2025-02-17 22:49:06,226 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 486 [2025-02-17 22:49:06,234 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:06,234 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:06,234 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:06,234 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:06,234 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:06,234 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:06,234 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:06,235 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:06,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 3.0298013245033113) internal successors, (915), 302 states have internal predecessors, (915), 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:49:06,264 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 280 [2025-02-17 22:49:06,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:06,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:06,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:06,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:06,268 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:06,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 3.0298013245033113) internal successors, (915), 302 states have internal predecessors, (915), 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:49:06,283 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 280 [2025-02-17 22:49:06,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:06,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:06,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:06,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:06,291 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:06,291 INFO L754 eck$LassoCheckResult]: Loop: "[78] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[81] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2025-02-17 22:49:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234345561] [2025-02-17 22:49:06,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:06,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:06,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:06,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:06,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash 3460, now seen corresponding path program 1 times [2025-02-17 22:49:06,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688148047] [2025-02-17 22:49:06,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash 128390, now seen corresponding path program 1 times [2025-02-17 22:49:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890739882] [2025-02-17 22:49:06,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:06,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:06,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:06,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,435 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,435 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,435 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,436 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,436 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:06,436 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,436 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:06,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,436 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,486 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,486 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,505 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:49:06,506 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:49:06,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,528 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:49:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,531 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:49:06,532 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:49:06,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:06,534 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,604 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:06,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:06,610 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,610 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,610 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,610 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,610 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:06,610 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,610 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,610 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,610 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:06,610 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,610 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,638 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,641 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,643 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:49:06,645 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:49:06,646 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:49:06,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:06,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:06,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:06,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,669 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:06,670 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:06,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,673 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:49:06,675 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:49:06,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,677 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:06,677 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,677 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:49:06,683 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:49:06,685 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:06,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:49:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:06,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:06,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,764 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:49:06,794 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:49:06,796 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 303 states, 302 states have (on average 3.0298013245033113) internal successors, (915), 302 states have internal predecessors, (915), 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 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:49:06,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 303 states, 302 states have (on average 3.0298013245033113) internal successors, (915), 302 states have internal predecessors, (915), 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 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 774 states and 2567 transitions. Complement of second has 6 states. [2025-02-17 22:49:06,942 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:49:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:49:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-02-17 22:49:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:49:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:49:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 774 states and 2567 transitions. [2025-02-17 22:49:06,961 INFO L131 ngComponentsAnalysis]: Automaton has 83 accepting balls. 248 [2025-02-17 22:49:06,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 774 states to 495 states and 1690 transitions. [2025-02-17 22:49:06,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2025-02-17 22:49:06,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2025-02-17 22:49:06,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 1690 transitions. [2025-02-17 22:49:06,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:06,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 495 states and 1690 transitions. [2025-02-17 22:49:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 1690 transitions. [2025-02-17 22:49:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 391. [2025-02-17 22:49:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 391 states have (on average 3.419437340153453) internal successors, (1337), 390 states have internal predecessors, (1337), 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:49:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1337 transitions. [2025-02-17 22:49:07,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 391 states and 1337 transitions. [2025-02-17 22:49:07,016 INFO L432 stractBuchiCegarLoop]: Abstraction has 391 states and 1337 transitions. [2025-02-17 22:49:07,016 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:07,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 391 states and 1337 transitions. [2025-02-17 22:49:07,020 INFO L131 ngComponentsAnalysis]: Automaton has 83 accepting balls. 248 [2025-02-17 22:49:07,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:07,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:07,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:07,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:07,021 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: 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]" [2025-02-17 22:49:07,021 INFO L754 eck$LassoCheckResult]: Loop: "[85] L36-->L38: Formula: (< v_x2_1 v_z_5) InVars {x2=v_x2_1, z=v_z_5} OutVars{x2=v_x2_1, z=v_z_5} AuxVars[] AssignedVars[]" "[88] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:07,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash 4164, now seen corresponding path program 1 times [2025-02-17 22:49:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464775329] [2025-02-17 22:49:07,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 3684, now seen corresponding path program 1 times [2025-02-17 22:49:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582916243] [2025-02-17 22:49:07,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash 4004327, now seen corresponding path program 1 times [2025-02-17 22:49:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335218925] [2025-02-17 22:49:07,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:07,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:07,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:07,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,060 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:07,061 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:07,061 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:07,061 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:07,061 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:07,061 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,061 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:07,061 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:07,061 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:07,061 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:07,061 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:07,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,075 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:07,076 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:07,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,077 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:49:07,078 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:49:07,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,103 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:49:07,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,105 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:49:07,105 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:49:07,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:07,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,176 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:07,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:07,180 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:07,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:07,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:07,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:07,180 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:07,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:07,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:07,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:07,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:07,180 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:07,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,201 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:07,201 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,203 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:49:07,203 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:49:07,204 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:49:07,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:07,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:07,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:07,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:07,220 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:07,220 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,222 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:49:07,224 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:49:07,225 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:07,225 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:07,225 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:07,225 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:49:07,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:49:07,277 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:07,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:07,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:07,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:49:07,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:49:07,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 391 states and 1337 transitions. cyclomatic complexity: 1050 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:49:07,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 391 states and 1337 transitions. cyclomatic complexity: 1050. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 1056 states and 3765 transitions. Complement of second has 6 states. [2025-02-17 22:49:07,422 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:49:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:49:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-02-17 22:49:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1056 states and 3765 transitions. [2025-02-17 22:49:07,437 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 215 [2025-02-17 22:49:07,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1056 states to 720 states and 2530 transitions. [2025-02-17 22:49:07,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2025-02-17 22:49:07,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2025-02-17 22:49:07,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 2530 transitions. [2025-02-17 22:49:07,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:07,456 INFO L218 hiAutomatonCegarLoop]: Abstraction has 720 states and 2530 transitions. [2025-02-17 22:49:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 2530 transitions. [2025-02-17 22:49:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 608. [2025-02-17 22:49:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 608 states have (on average 3.59375) internal successors, (2185), 607 states have internal predecessors, (2185), 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:49:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 2185 transitions. [2025-02-17 22:49:07,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 608 states and 2185 transitions. [2025-02-17 22:49:07,485 INFO L432 stractBuchiCegarLoop]: Abstraction has 608 states and 2185 transitions. [2025-02-17 22:49:07,485 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:07,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 608 states and 2185 transitions. [2025-02-17 22:49:07,487 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 215 [2025-02-17 22:49:07,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:07,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:07,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:07,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:07,488 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L23-->L27-1: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-02-17 22:49:07,488 INFO L754 eck$LassoCheckResult]: Loop: "[80] L27-1-->L29: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[83] L29-->L27-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 4138, now seen corresponding path program 1 times [2025-02-17 22:49:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774317775] [2025-02-17 22:49:07,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash 3524, now seen corresponding path program 1 times [2025-02-17 22:49:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089965167] [2025-02-17 22:49:07,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,508 INFO L85 PathProgramCache]: Analyzing trace with hash 3979181, now seen corresponding path program 1 times [2025-02-17 22:49:07,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088964047] [2025-02-17 22:49:07,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:07,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:07,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:07,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:07,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,536 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:07,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:07,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:07,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:07,536 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:07,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:07,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:07,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:07,537 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:07,537 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:07,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,551 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:07,552 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:07,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,554 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:49:07,555 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:49:07,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,573 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:49:07,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,576 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:49:07,577 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:49:07,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:07,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,652 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:07,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:49:07,657 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:07,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:07,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:07,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:07,657 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:07,657 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,657 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:07,657 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:07,657 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:07,657 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:07,657 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:07,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,699 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:07,699 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:07,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,712 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:49:07,733 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:49:07,734 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:49:07,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:07,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:07,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:07,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:07,752 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:07,752 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,772 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:49:07,774 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:49:07,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:07,775 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:07,775 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:07,775 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:07,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:07,784 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:07,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:07,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:07,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:07,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:07,876 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:49:07,876 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:49:07,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 608 states and 2185 transitions. cyclomatic complexity: 1715 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:49:08,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 608 states and 2185 transitions. cyclomatic complexity: 1715. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 1322 states and 4844 transitions. Complement of second has 6 states. [2025-02-17 22:49:08,036 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:49:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:49:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-17 22:49:08,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:08,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:08,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:08,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1322 states and 4844 transitions. [2025-02-17 22:49:08,044 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:49:08,052 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:49:08,062 INFO L131 ngComponentsAnalysis]: Automaton has 73 accepting balls. 172 [2025-02-17 22:49:08,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1322 states to 961 states and 3557 transitions. [2025-02-17 22:49:08,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2025-02-17 22:49:08,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426 [2025-02-17 22:49:08,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 961 states and 3557 transitions. [2025-02-17 22:49:08,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:08,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 961 states and 3557 transitions. [2025-02-17 22:49:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states and 3557 transitions. [2025-02-17 22:49:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 822. [2025-02-17 22:49:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 822 states have (on average 3.8333333333333335) internal successors, (3151), 821 states have internal predecessors, (3151), 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:49:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 3151 transitions. [2025-02-17 22:49:08,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 822 states and 3151 transitions. [2025-02-17 22:49:08,127 INFO L432 stractBuchiCegarLoop]: Abstraction has 822 states and 3151 transitions. [2025-02-17 22:49:08,127 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:08,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 822 states and 3151 transitions. [2025-02-17 22:49:08,131 INFO L131 ngComponentsAnalysis]: Automaton has 73 accepting balls. 172 [2025-02-17 22:49:08,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:08,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:08,132 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: 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]" "[84] L36-->L40-1: Formula: (<= v_z_6 v_x2_4) InVars {x2=v_x2_4, z=v_z_6} OutVars{x2=v_x2_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-02-17 22:49:08,132 INFO L754 eck$LassoCheckResult]: Loop: "[87] L40-1-->L42: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[90] L42-->L40-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:08,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash 129168, now seen corresponding path program 1 times [2025-02-17 22:49:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553071705] [2025-02-17 22:49:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 3748, now seen corresponding path program 1 times [2025-02-17 22:49:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590084750] [2025-02-17 22:49:08,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 124133235, now seen corresponding path program 1 times [2025-02-17 22:49:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130551829] [2025-02-17 22:49:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:08,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:08,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:08,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:08,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,188 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,189 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,189 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,189 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,189 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:08,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:08,189 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,189 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,204 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,204 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:08,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,206 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:49:08,207 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:49:08,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:08,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:49:08,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,226 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:49:08,227 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:49:08,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:08,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,294 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:08,298 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:49:08,298 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,298 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,298 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,298 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,298 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:08,298 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,298 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,298 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,298 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:08,298 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,298 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,316 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,316 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:08,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,319 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:49:08,320 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:49:08,321 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:49:08,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:08,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:08,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:08,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:08,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:08,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:08,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:08,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:08,339 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:08,339 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:08,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,341 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:49:08,342 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:49:08,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:08,342 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:08,343 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:08,343 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:08,348 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:49:08,351 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:08,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,397 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:08,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,416 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:49:08,416 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:49:08,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 822 states and 3151 transitions. cyclomatic complexity: 2485 Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:49:08,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 822 states and 3151 transitions. cyclomatic complexity: 2485. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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) Result 1586 states and 6164 transitions. Complement of second has 6 states. [2025-02-17 22:49:08,488 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:49:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) 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:49:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-17 22:49:08,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1586 states and 6164 transitions. [2025-02-17 22:49:08,502 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 130 [2025-02-17 22:49:08,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1586 states to 1077 states and 4291 transitions. [2025-02-17 22:49:08,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 357 [2025-02-17 22:49:08,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2025-02-17 22:49:08,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1077 states and 4291 transitions. [2025-02-17 22:49:08,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:08,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1077 states and 4291 transitions. [2025-02-17 22:49:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states and 4291 transitions. [2025-02-17 22:49:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 949. [2025-02-17 22:49:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 949 states have (on average 4.038988408851423) internal successors, (3833), 948 states have internal predecessors, (3833), 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:49:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 3833 transitions. [2025-02-17 22:49:08,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 949 states and 3833 transitions. [2025-02-17 22:49:08,532 INFO L432 stractBuchiCegarLoop]: Abstraction has 949 states and 3833 transitions. [2025-02-17 22:49:08,532 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:08,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 949 states and 3833 transitions. [2025-02-17 22:49:08,537 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 130 [2025-02-17 22:49:08,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:08,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:08,537 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: 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]" "[106] L13-->L49: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:49:08,537 INFO L754 eck$LassoCheckResult]: Loop: "[92] L49-->L51: Formula: (< v_x5_2 v_z_12) InVars {x5=v_x5_2, z=v_z_12} OutVars{x5=v_x5_2, z=v_z_12} AuxVars[] AssignedVars[]" "[95] L51-->L49: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 129190, now seen corresponding path program 1 times [2025-02-17 22:49:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560229167] [2025-02-17 22:49:08,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash 3908, now seen corresponding path program 1 times [2025-02-17 22:49:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958505556] [2025-02-17 22:49:08,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,551 INFO L85 PathProgramCache]: Analyzing trace with hash 124154537, now seen corresponding path program 1 times [2025-02-17 22:49:08,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419756999] [2025-02-17 22:49:08,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:08,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:08,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:08,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:08,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,576 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,576 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,576 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,576 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,576 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:08,576 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,576 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,576 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,576 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:08,576 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,576 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,591 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,591 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,593 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:49:08,595 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:49:08,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:08,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,612 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:49:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,615 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:49:08,616 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:49:08,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:08,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,683 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:08,688 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:49:08,688 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:08,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:08,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,688 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,704 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,704 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:08,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,706 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:49:08,726 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:49:08,726 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:49:08,726 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:49:08,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:08,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:08,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:08,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:08,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:08,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:08,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:08,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:08,744 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:08,744 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:08,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,746 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:49:08,747 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:49:08,747 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:08,747 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:08,747 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:08,747 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-02-17 22:49:08,753 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:49:08,753 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:08,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:08,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,797 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:49:08,798 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:49:08,798 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 949 states and 3833 transitions. cyclomatic complexity: 3042 Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:49:08,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 949 states and 3833 transitions. cyclomatic complexity: 3042. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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) Result 2720 states and 11218 transitions. Complement of second has 6 states. [2025-02-17 22:49:08,874 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:49:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) 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:49:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-17 22:49:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:08,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:08,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:08,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2720 states and 11218 transitions. [2025-02-17 22:49:08,898 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 68 [2025-02-17 22:49:08,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2720 states to 1743 states and 6780 transitions. [2025-02-17 22:49:08,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2025-02-17 22:49:08,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2025-02-17 22:49:08,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1743 states and 6780 transitions. [2025-02-17 22:49:08,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:08,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1743 states and 6780 transitions. [2025-02-17 22:49:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states and 6780 transitions. [2025-02-17 22:49:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1508. [2025-02-17 22:49:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1508 states have (on average 3.9383289124668437) internal successors, (5939), 1507 states have internal predecessors, (5939), 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:49:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 5939 transitions. [2025-02-17 22:49:08,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1508 states and 5939 transitions. [2025-02-17 22:49:08,946 INFO L432 stractBuchiCegarLoop]: Abstraction has 1508 states and 5939 transitions. [2025-02-17 22:49:08,947 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:08,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 5939 transitions. [2025-02-17 22:49:08,953 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 68 [2025-02-17 22:49:08,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,954 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:08,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:08,954 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: 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]" "[106] L13-->L49: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[91] L49-->L53-1: Formula: (<= v_z_9 v_x5_1) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" [2025-02-17 22:49:08,954 INFO L754 eck$LassoCheckResult]: Loop: "[94] L53-1-->L55: Formula: (< v_x6_1 v_z_10) InVars {x6=v_x6_1, z=v_z_10} OutVars{x6=v_x6_1, z=v_z_10} AuxVars[] AssignedVars[]" "[97] L55-->L53-1: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-02-17 22:49:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 4004981, now seen corresponding path program 1 times [2025-02-17 22:49:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126542822] [2025-02-17 22:49:08,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:08,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:08,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:08,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash 3972, now seen corresponding path program 1 times [2025-02-17 22:49:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369526051] [2025-02-17 22:49:08,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash -446177544, now seen corresponding path program 1 times [2025-02-17 22:49:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770965782] [2025-02-17 22:49:08,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:08,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:08,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:08,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:08,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,995 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,996 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:08,996 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,996 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,996 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,996 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:08,996 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,996 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,011 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,011 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:09,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,014 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:49:09,016 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:49:09,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:09,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,035 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:49:09,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,037 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:49:09,039 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:49:09,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:09,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,108 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:09,112 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:49:09,113 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:09,113 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:09,113 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:09,113 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:09,113 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:09,113 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:09,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:09,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:09,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:09,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:09,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,132 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,133 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:09,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,135 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:49:09,136 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:49:09,137 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:49:09,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:09,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:09,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:09,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:09,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:09,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:09,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:09,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:09,153 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:09,153 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:09,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,155 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:49:09,156 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:49:09,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:09,157 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:09,157 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:09,157 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-02-17 22:49:09,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:09,164 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:09,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:09,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,209 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:49:09,209 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:49:09,210 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1508 states and 5939 transitions. cyclomatic complexity: 4642 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:49:09,281 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:49:09,287 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:49:09,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1508 states and 5939 transitions. cyclomatic complexity: 4642. 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 2541 states and 9769 transitions. Complement of second has 6 states. [2025-02-17 22:49:09,291 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:49:09,291 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:49:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-17 22:49:09,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:09,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:09,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:09,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2541 states and 9769 transitions. [2025-02-17 22:49:09,308 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:09,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2541 states to 0 states and 0 transitions. [2025-02-17 22:49:09,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:09,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:09,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:09,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:09,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:09,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:09,309 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:09,309 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:49:09,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:09,309 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:09,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:09,314 INFO L201 PluginConnector]: Adding new model seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:09 BoogieIcfgContainer [2025-02-17 22:49:09,314 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:09,315 INFO L158 Benchmark]: Toolchain (without parser) took 3676.65ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.2MB in the beginning and 85.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:09,315 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:09,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.88ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:09,315 INFO L158 Benchmark]: Boogie Preprocessor took 10.49ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.4MB in the end (delta: 680.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:09,315 INFO L158 Benchmark]: RCFGBuilder took 162.49ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 75.1MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:49:09,315 INFO L158 Benchmark]: BuchiAutomizer took 3481.47ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.1MB in the beginning and 85.2MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:09,316 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.13ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.88ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 10.49ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.4MB in the end (delta: 680.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 162.49ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 75.1MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3481.47ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.1MB in the beginning and 85.2MB in the end (delta: -10.1MB). There was no memory consumed. 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 (0 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 718 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 305 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 152 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 308, Trivial Ample Sets caused by loops: 486, Number of non-trivial ample sets: 384, Number of pruned transitions: 110, Number of transitions in reduction automaton: 915, Number of states in reduction automaton: 303, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:09,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...