/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/bb6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:57,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:57,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:57,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:57,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:57,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:57,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:57,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:57,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:57,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:57,348 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:57,348 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:57,348 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:57,348 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:57,348 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:57,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:57,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:57,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:57,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:57,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:57,350 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:57,350 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:57,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:57,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:57,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:57,600 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:57,605 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:57,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/bb6.c.bpl [2025-02-17 22:48:57,606 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/bb6.c.bpl' [2025-02-17 22:48:57,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:57,619 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:57,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:57,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:57,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:57,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,636 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:57,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:57,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:57,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:57,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:57,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:57,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:57,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:57,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:57,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:57,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:57,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:48:57,706 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:57,706 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:57,706 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:57,706 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:57,706 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:57,706 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:57,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:48:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:48:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:48:57,707 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:57,707 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:57,744 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:57,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:57,823 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:57,824 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:57,831 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:57,831 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:57,832 INFO L201 PluginConnector]: Adding new model bb6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:57 BoogieIcfgContainer [2025-02-17 22:48:57,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:57,833 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:57,833 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:57,840 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:57,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:57,841 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/2) ... [2025-02-17 22:48:57,843 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22ece3a0 and model type bb6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:57, skipping insertion in model container [2025-02-17 22:48:57,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:57,843 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:57" (2/2) ... [2025-02-17 22:48:57,845 INFO L363 chiAutomizerObserver]: Analyzing ICFG bb6.c.bpl [2025-02-17 22:48:57,903 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:48:57,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 103 flow [2025-02-17 22:48:57,973 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-02-17 22:48:57,976 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:48:57,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-17 22:48:57,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 103 flow [2025-02-17 22:48:57,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 35 transitions, 88 flow [2025-02-17 22:48:57,991 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:58,632 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:58,633 INFO L101 AmpleReduction]: Number of pruned transitions: 558, Number of non-trivial ample sets: 741 [2025-02-17 22:48:58,633 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 561 [2025-02-17 22:48:58,641 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:58,641 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:58,641 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:58,641 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:58,641 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:58,641 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:58,642 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:58,642 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:58,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,687 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-02-17 22:48:58,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:58,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:58,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:58,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:58,695 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:58,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,705 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-02-17 22:48:58,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:58,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:58,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:58,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:58,714 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:58,714 INFO L754 eck$LassoCheckResult]: Loop: "[92] L24-->L26: 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[]" "[94] L26-->L24: 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:48:58,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,717 INFO L85 PathProgramCache]: Analyzing trace with hash 3685, now seen corresponding path program 1 times [2025-02-17 22:48:58,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945718296] [2025-02-17 22:48:58,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:58,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:58,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:58,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:58,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:58,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:58,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:58,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:58,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,790 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-02-17 22:48:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:58,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490196725] [2025-02-17 22:48:58,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:58,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:58,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:58,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:58,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:58,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:58,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 3544231, now seen corresponding path program 1 times [2025-02-17 22:48:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:58,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215460972] [2025-02-17 22:48:58,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:58,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:58,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:58,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:58,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:58,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:58,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:58,839 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:58,840 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:58,840 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:58,840 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:58,840 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:58,840 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,840 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:58,840 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:58,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:58,841 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:58,841 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:58,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:58,913 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:58,914 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:58,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:58,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:48:58,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:58,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:58,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:58,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:58,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:48:58,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:58,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,024 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:48:59,028 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,029 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,051 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,054 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:48:59,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:59,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,083 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:59,083 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:48:59,089 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,089 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,089 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,090 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:48:59,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:48:59,099 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:59,217 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:59,220 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 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.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:48:59,394 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 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.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 2050 states and 5406 transitions. Complement of second has 7 states. [2025-02-17 22:48:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:59,400 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:48:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-02-17 22:48:59,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 121 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:48:59,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 121 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:48:59,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 121 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:48:59,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 5406 transitions. [2025-02-17 22:48:59,434 INFO L131 ngComponentsAnalysis]: Automaton has 166 accepting balls. 400 [2025-02-17 22:48:59,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 1533 states and 4153 transitions. [2025-02-17 22:48:59,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 645 [2025-02-17 22:48:59,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 904 [2025-02-17 22:48:59,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1533 states and 4153 transitions. [2025-02-17 22:48:59,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1533 states and 4153 transitions. [2025-02-17 22:48:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states and 4153 transitions. [2025-02-17 22:48:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1276. [2025-02-17 22:48:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1276 states have (on average 2.7656739811912225) internal successors, (3529), 1275 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3529 transitions. [2025-02-17 22:48:59,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1276 states and 3529 transitions. [2025-02-17 22:48:59,531 INFO L432 stractBuchiCegarLoop]: Abstraction has 1276 states and 3529 transitions. [2025-02-17 22:48:59,531 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:59,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1276 states and 3529 transitions. [2025-02-17 22:48:59,537 INFO L131 ngComponentsAnalysis]: Automaton has 166 accepting balls. 400 [2025-02-17 22:48:59,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:59,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,537 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: 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:48:59,538 INFO L754 eck$LassoCheckResult]: Loop: "[101] L39-->L41: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[103] L41-->L39: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:48:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash 114358, now seen corresponding path program 1 times [2025-02-17 22:48:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250731403] [2025-02-17 22:48:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-02-17 22:48:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713860724] [2025-02-17 22:48:59,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 109901272, now seen corresponding path program 1 times [2025-02-17 22:48:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781538878] [2025-02-17 22:48:59,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:59,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:59,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:59,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:59,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,573 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,573 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,574 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,574 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,574 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,574 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:59,574 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,574 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,589 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,589 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:48:59,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:48:59,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:48:59,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,677 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:48:59,682 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,682 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,682 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,682 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:59,682 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,682 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,699 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,699 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:48:59,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:59,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:59,720 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:59,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:48:59,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,724 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,725 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,725 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:48:59,730 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:48:59,731 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,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:48:59,764 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:59,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1276 states and 3529 transitions. cyclomatic complexity: 2533 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:48:59,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1276 states and 3529 transitions. cyclomatic complexity: 2533. 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 4468 states and 12919 transitions. Complement of second has 7 states. [2025-02-17 22:48:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:59,898 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:48:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-02-17 22:48:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:48:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:59,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:48:59,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4468 states and 12919 transitions. [2025-02-17 22:48:59,939 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 238 [2025-02-17 22:48:59,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4468 states to 2802 states and 8238 transitions. [2025-02-17 22:48:59,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 802 [2025-02-17 22:48:59,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1093 [2025-02-17 22:48:59,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2802 states and 8238 transitions. [2025-02-17 22:48:59,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2802 states and 8238 transitions. [2025-02-17 22:48:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states and 8238 transitions. [2025-02-17 22:49:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2515. [2025-02-17 22:49:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2515 states have (on average 3.033797216699801) internal successors, (7630), 2514 states have internal predecessors, (7630), 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:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 7630 transitions. [2025-02-17 22:49:00,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2515 states and 7630 transitions. [2025-02-17 22:49:00,017 INFO L432 stractBuchiCegarLoop]: Abstraction has 2515 states and 7630 transitions. [2025-02-17 22:49:00,017 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:00,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2515 states and 7630 transitions. [2025-02-17 22:49:00,029 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 238 [2025-02-17 22:49:00,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:00,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,030 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: 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]" "[126] L14-->L54: 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:00,030 INFO L754 eck$LassoCheckResult]: Loop: "[110] L54-->L56: Formula: (< v_x4_5 v_z_9) InVars {x4=v_x4_5, z=v_z_9} OutVars{x4=v_x4_5, z=v_z_9} AuxVars[] AssignedVars[]" "[112] L56-->L54: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:00,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 3545224, now seen corresponding path program 1 times [2025-02-17 22:49:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888446941] [2025-02-17 22:49:00,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-02-17 22:49:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787441167] [2025-02-17 22:49:00,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -888003510, now seen corresponding path program 1 times [2025-02-17 22:49:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138399242] [2025-02-17 22:49:00,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,080 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,080 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,080 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,080 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,080 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,097 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,097 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,099 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:00,101 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:00,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:49:00,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,121 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:00,123 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:00,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,190 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,194 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:00,195 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,195 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,195 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,195 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,195 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,195 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,195 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,195 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,195 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,195 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,195 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,214 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,215 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,218 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:00,219 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:00,220 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:00,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,234 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,238 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:00,239 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:00,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,241 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:00,243 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:00,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,244 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,244 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,244 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:00,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:49:00,251 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,298 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:00,298 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:00,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2515 states and 7630 transitions. cyclomatic complexity: 5525 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:00,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:49:00,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2515 states and 7630 transitions. cyclomatic complexity: 5525. 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 8153 states and 24880 transitions. Complement of second has 7 states. [2025-02-17 22:49:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:00,438 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:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-02-17 22:49:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 130 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 130 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 130 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8153 states and 24880 transitions. [2025-02-17 22:49:00,495 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-02-17 22:49:00,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8153 states to 145 states and 322 transitions. [2025-02-17 22:49:00,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-02-17 22:49:00,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-02-17 22:49:00,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 322 transitions. [2025-02-17 22:49:00,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 322 transitions. [2025-02-17 22:49:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 322 transitions. [2025-02-17 22:49:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-17 22:49:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 2.220689655172414) internal successors, (322), 144 states have internal predecessors, (322), 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:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 322 transitions. [2025-02-17 22:49:00,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 145 states and 322 transitions. [2025-02-17 22:49:00,499 INFO L432 stractBuchiCegarLoop]: Abstraction has 145 states and 322 transitions. [2025-02-17 22:49:00,499 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:00,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 322 transitions. [2025-02-17 22:49:00,499 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-02-17 22:49:00,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:00,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,500 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L24-->L28: 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[]" "[93] L28-->L29: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[95] L29-->L30-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:00,500 INFO L754 eck$LassoCheckResult]: Loop: "[97] L30-1-->L32: 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[]" "[99] L32-->L30-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:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash 109870264, now seen corresponding path program 1 times [2025-02-17 22:49:00,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65894679] [2025-02-17 22:49:00,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,529 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:00,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65894679] [2025-02-17 22:49:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65894679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:00,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:00,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231842313] [2025-02-17 22:49:00,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:00,533 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-02-17 22:49:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290552574] [2025-02-17 22:49:00,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,548 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,548 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:00,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,548 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,564 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,564 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,566 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:00,567 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:00,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,590 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:00,592 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:00,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,659 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,664 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,664 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,664 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,664 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,664 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,664 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,664 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,665 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:00,665 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,665 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,681 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,681 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,683 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:00,685 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:00,687 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:00,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,708 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:00,709 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:00,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,711 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:00,713 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:00,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,713 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,713 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,714 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:00,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,721 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,760 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:00,760 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:00,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 322 transitions. cyclomatic complexity: 201 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 322 transitions. cyclomatic complexity: 201. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 301 states and 696 transitions. Complement of second has 7 states. [2025-02-17 22:49:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-02-17 22:49:00,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:00,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:00,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:00,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 696 transitions. [2025-02-17 22:49:00,801 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-02-17 22:49:00,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 205 states and 449 transitions. [2025-02-17 22:49:00,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-02-17 22:49:00,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2025-02-17 22:49:00,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 449 transitions. [2025-02-17 22:49:00,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 205 states and 449 transitions. [2025-02-17 22:49:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 449 transitions. [2025-02-17 22:49:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 147. [2025-02-17 22:49:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 2.204081632653061) internal successors, (324), 146 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 324 transitions. [2025-02-17 22:49:00,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 324 transitions. [2025-02-17 22:49:00,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:00,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:49:00,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:49:00,817 INFO L87 Difference]: Start difference. First operand 147 states and 324 transitions. Second operand has 4 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:00,819 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:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:00,836 INFO L93 Difference]: Finished difference Result 84 states and 165 transitions. [2025-02-17 22:49:00,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 165 transitions. [2025-02-17 22:49:00,836 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-17 22:49:00,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 74 states and 141 transitions. [2025-02-17 22:49:00,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-02-17 22:49:00,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-02-17 22:49:00,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 141 transitions. [2025-02-17 22:49:00,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 141 transitions. [2025-02-17 22:49:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 141 transitions. [2025-02-17 22:49:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-17 22:49:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 73 states have internal predecessors, (141), 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:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 141 transitions. [2025-02-17 22:49:00,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 141 transitions. [2025-02-17 22:49:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:49:00,841 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 141 transitions. [2025-02-17 22:49:00,841 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:00,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 141 transitions. [2025-02-17 22:49:00,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-17 22:49:00,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:00,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,842 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L24-->L28: 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[]" "[93] L28-->L29: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[123] L13-1-->L39: 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]" "[100] L39-->L43: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[102] L43-->L44: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[104] L44-->L45-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-02-17 22:49:00,842 INFO L754 eck$LassoCheckResult]: Loop: "[106] L45-1-->L47: 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[]" "[108] L47-->L45-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:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash 380888786, now seen corresponding path program 1 times [2025-02-17 22:49:00,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379925337] [2025-02-17 22:49:00,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:00,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:00,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,874 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:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379925337] [2025-02-17 22:49:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379925337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:00,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:00,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:49:00,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185859473] [2025-02-17 22:49:00,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:00,875 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash 4355, now seen corresponding path program 1 times [2025-02-17 22:49:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403975061] [2025-02-17 22:49:00,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,893 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,893 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,893 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,893 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:00,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,893 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,907 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,907 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,911 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:00,913 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:00,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,931 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:00,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,935 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:00,937 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:00,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:01,005 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:01,009 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:01,009 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:01,010 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:01,010 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:01,010 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:01,010 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:01,010 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,010 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:01,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:01,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb6.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:01,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:01,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:01,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:01,030 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:01,030 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:01,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,032 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:01,034 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:01,035 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:01,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:01,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:01,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:01,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:01,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:01,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:01,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:01,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:01,051 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:01,051 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:01,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,052 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:01,054 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:01,054 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:01,055 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:01,055 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:01,055 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:01,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:01,060 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:01,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:01,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:01,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,086 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,095 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:01,096 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:01,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 141 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:01,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 141 transitions. cyclomatic complexity: 80. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 101 states and 192 transitions. Complement of second has 6 states. [2025-02-17 22:49:01,114 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:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-02-17 22:49:01,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:01,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:01,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:49:01,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 192 transitions. [2025-02-17 22:49:01,115 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:01,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:01,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:01,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:01,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:01,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-17 22:49:01,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-17 22:49:01,116 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:01,116 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:01,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:01,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:01,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:01,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:49:01,117 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,117 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:01,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:01,117 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:01,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:01,125 INFO L201 PluginConnector]: Adding new model bb6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:01 BoogieIcfgContainer [2025-02-17 22:49:01,125 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:01,125 INFO L158 Benchmark]: Toolchain (without parser) took 3506.24ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 90.3MB in the beginning and 89.6MB in the end (delta: 635.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,125 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 163.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.58ms. Allocated memory is still 163.6MB. Free memory was 90.1MB in the beginning and 88.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,126 INFO L158 Benchmark]: Boogie Preprocessor took 16.30ms. Allocated memory is still 163.6MB. Free memory was 88.9MB in the beginning and 88.2MB in the end (delta: 725.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,126 INFO L158 Benchmark]: RCFGBuilder took 177.09ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 78.8MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:49:01,126 INFO L158 Benchmark]: BuchiAutomizer took 3292.34ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 78.7MB in the beginning and 89.6MB in the end (delta: -10.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,127 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.26ms. Allocated memory is still 163.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.58ms. Allocated memory is still 163.6MB. Free memory was 90.1MB in the beginning and 88.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.30ms. Allocated memory is still 163.6MB. Free memory was 88.9MB in the beginning and 88.2MB in the end (delta: 725.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 177.09ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 78.8MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3292.34ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 78.7MB in the beginning and 89.6MB in the end (delta: -10.9MB). 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 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 602 StatesRemovedByMinimization, 3 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 318 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 163 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 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: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 710, Trivial Ample Sets caused by loops: 561, Number of non-trivial ample sets: 741, Number of pruned transitions: 558, Number of transitions in reduction automaton: 1539, Number of states in reduction automaton: 635, 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:01,139 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:01,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...