/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/b5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:30,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:30,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:30,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:30,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:30,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:30,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:30,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:30,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:30,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:30,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:30,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:30,711 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:30,711 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:30,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:30,712 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:30,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:30,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:30,713 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:30,713 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:30,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:30,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:30,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:30,938 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:30,938 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:30,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/b5.c.bpl [2025-04-26 16:56:30,939 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/b5.c.bpl' [2025-04-26 16:56:30,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:30,950 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:30,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:30,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:30,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:30,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,976 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:30,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:30,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:30,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:30,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:30,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,983 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:30,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:30,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:30,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:30,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:30,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/1) ... [2025-04-26 16:56:31,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:31,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:31,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:31,041 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:31,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:31,041 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:31,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:31,041 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:31,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:31,042 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:31,073 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:31,075 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:31,125 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:31,125 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:31,131 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:31,132 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:31,132 INFO L201 PluginConnector]: Adding new model b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:31 BoogieIcfgContainer [2025-04-26 16:56:31,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:31,133 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:31,133 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:31,136 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:31,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:31,137 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:30" (1/2) ... [2025-04-26 16:56:31,138 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b1bf68f and model type b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:31, skipping insertion in model container [2025-04-26 16:56:31,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:31,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:31" (2/2) ... [2025-04-26 16:56:31,139 INFO L376 chiAutomizerObserver]: Analyzing ICFG b5.c.bpl [2025-04-26 16:56:31,184 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:31,218 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:31,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:31,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:56:31,278 INFO L116 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-04-26 16:56:31,279 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:31,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-26 16:56:31,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:56:31,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-04-26 16:56:31,284 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 16 transitions, 44 flow [2025-04-26 16:56:31,289 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:31,321 WARN L140 AmpleReduction]: Number of pruned transitions: 25 [2025-04-26 16:56:31,321 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:31,321 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 6 [2025-04-26 16:56:31,321 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:14 [2025-04-26 16:56:31,321 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:21 [2025-04-26 16:56:31,321 WARN L145 AmpleReduction]: Times succ was already a loop node:6 [2025-04-26 16:56:31,321 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8 [2025-04-26 16:56:31,321 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:31,323 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (in total 56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:31,327 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:31,328 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:31,328 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:31,328 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:31,328 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:31,328 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:31,328 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:31,328 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:31,329 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (in total 56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:31,337 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-04-26 16:56:31,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:31,337 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:31,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:56:31,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:31,340 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:31,340 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (in total 56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:31,342 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-04-26 16:56:31,343 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:31,343 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:31,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:56:31,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:31,347 INFO L752 eck$LassoCheckResult]: Stem: "[51] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:31,348 INFO L754 eck$LassoCheckResult]: Loop: "[39] L21-->L23: Formula: (< (+ v_x5_1 v_x4_1 v_x3_1 v_x1_1) v_z_1) InVars {x1=v_x1_1, x4=v_x4_1, x5=v_x5_1, x3=v_x3_1, z=v_z_1} OutVars{x1=v_x1_1, x4=v_x4_1, x5=v_x5_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[41] L23-->L24: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[42] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[43] L25-->L26: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[44] L26-->L21: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 16:56:31,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 82, now seen corresponding path program 1 times [2025-04-26 16:56:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:31,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708546663] [2025-04-26 16:56:31,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:31,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:56:31,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:56:31,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:31,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:56:31,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:56:31,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:31,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 65909640, now seen corresponding path program 1 times [2025-04-26 16:56:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:31,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976660986] [2025-04-26 16:56:31,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:31,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:31,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:31,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:31,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:31,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:31,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:31,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1910096425, now seen corresponding path program 1 times [2025-04-26 16:56:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:31,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846066581] [2025-04-26 16:56:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:31,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:31,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:31,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:31,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:31,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:31,562 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:31,562 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:31,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:31,563 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:31,563 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:31,563 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,563 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:31,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:31,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:31,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:31,564 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:31,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,693 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:31,694 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:31,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:31,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:31,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:31,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:31,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:31,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:31,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:31,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:31,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:31,894 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:31,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:31,901 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:31,902 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:31,902 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:31,902 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:31,902 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:31,902 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,902 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:31,902 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:31,902 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:31,902 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:31,902 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:31,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,957 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:31,960 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:31,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:31,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:31,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:31,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:31,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:31,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:31,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:32,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:32,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:32,008 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:32,016 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:32,017 INFO L437 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:32,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:32,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:32,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:32,034 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:32,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:32,038 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:32,038 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:32,038 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, x1, z, x5, x4) = -1*x3 - 1*x1 + 1*z - 1*x5 - 1*x4 Supporting invariants [] [2025-04-26 16:56:32,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:32,046 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:32,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:32,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:56:32,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:56:32,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:32,104 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:32,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:32,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:32,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:32,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:32,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:56:32,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:32,241 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:56:32,244 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (in total 56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.0) internal successors, (in total 6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:32,321 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (in total 56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 6 states, 6 states have (on average 1.0) internal successors, (in total 6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 89 states and 121 transitions. Complement of second has 6 states. [2025-04-26 16:56:32,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.0) internal successors, (in total 6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 16:56:32,331 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 1 letters. Loop has 5 letters. [2025-04-26 16:56:32,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:32,332 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 16:56:32,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:32,332 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 1 letters. Loop has 10 letters. [2025-04-26 16:56:32,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:32,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 121 transitions. [2025-04-26 16:56:32,336 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:32,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 39 states and 52 transitions. [2025-04-26 16:56:32,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-04-26 16:56:32,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-04-26 16:56:32,339 INFO L74 IsDeterministic]: Start isDeterministic. Operand 39 states and 52 transitions. [2025-04-26 16:56:32,339 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:32,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 52 transitions. [2025-04-26 16:56:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 52 transitions. [2025-04-26 16:56:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-04-26 16:56:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3333333333333333) internal successors, (in total 48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-04-26 16:56:32,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-04-26 16:56:32,361 INFO L438 stractBuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-04-26 16:56:32,361 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:32,361 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2025-04-26 16:56:32,365 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:32,365 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:32,365 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:32,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:32,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:32,366 INFO L752 eck$LassoCheckResult]: Stem: "[51] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[38] L21-->thread1FINAL: Formula: (<= v_z_2 (+ v_x5_4 v_x4_4 v_x3_4 v_x1_4)) InVars {x1=v_x1_4, x4=v_x4_4, x5=v_x5_4, x3=v_x3_4, z=v_z_2} OutVars{x1=v_x1_4, x4=v_x4_4, x5=v_x5_4, x3=v_x3_4, z=v_z_2} AuxVars[] AssignedVars[]" "[40] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[54] L12-->L33: 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-04-26 16:56:32,366 INFO L754 eck$LassoCheckResult]: Loop: "[46] L33-->L35: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[48] L35-->L33: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:32,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2480674, now seen corresponding path program 1 times [2025-04-26 16:56:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:32,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242357265] [2025-04-26 16:56:32,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:32,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:32,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:32,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:32,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:32,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:32,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:32,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:32,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:32,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2025-04-26 16:56:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:32,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628437205] [2025-04-26 16:56:32,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:32,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:32,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:32,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:32,387 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:32,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:32,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:32,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:32,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:32,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1911038108, now seen corresponding path program 1 times [2025-04-26 16:56:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:32,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664189674] [2025-04-26 16:56:32,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:32,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:32,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:32,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:32,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:32,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:32,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:32,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:32,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:32,423 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:32,423 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:32,423 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:32,423 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:32,423 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:32,423 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:32,423 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:32,423 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:32,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:32,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:32,423 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:32,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:32,443 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:32,443 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:32,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:32,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:32,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:32,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:32,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:32,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:32,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:56:32,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:32,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:32,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:32,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:32,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:32,542 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:32,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:32,548 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:32,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:32,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:32,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:32,548 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:32,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:32,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:32,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:32,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:32,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:32,548 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:32,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:32,568 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:32,568 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:32,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:32,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:32,571 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:32,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:32,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:32,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:32,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:32,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:32,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:32,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:32,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:32,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:32,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:32,592 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:32,592 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:32,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:32,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:32,594 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:32,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:32,596 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:32,600 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:32,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:32,601 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:32,601 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:32,601 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:56:32,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:32,608 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:32,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:32,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:32,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:32,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:32,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:32,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:32,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:32,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:32,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:32,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:32,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:32,662 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:32,662 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:32,699 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 67 states and 91 transitions. Complement of second has 6 states. [2025-04-26 16:56:32,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-04-26 16:56:32,701 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:32,701 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:32,701 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:32,701 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:32,701 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:56:32,702 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:32,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 91 transitions. [2025-04-26 16:56:32,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:32,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2025-04-26 16:56:32,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:32,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:32,703 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:32,703 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:32,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:32,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:32,703 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:32,703 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:32,703 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:32,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:32,703 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:32,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:32,719 INFO L201 PluginConnector]: Adding new model b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:32 BoogieIcfgContainer [2025-04-26 16:56:32,719 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:32,720 INFO L158 Benchmark]: Toolchain (without parser) took 1769.32ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 78.4MB in the end (delta: 4.7MB). Peak memory consumption was 2.8MB. Max. memory is 8.0GB. [2025-04-26 16:56:32,720 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:32,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.93ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:32,721 INFO L158 Benchmark]: Boogie Preprocessor took 19.48ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 80.2MB in the end (delta: 854.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:32,721 INFO L158 Benchmark]: RCFGBuilder took 134.80ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 71.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:32,721 INFO L158 Benchmark]: BuchiAutomizer took 1586.73ms. Allocated memory is still 155.2MB. Free memory was 71.5MB in the beginning and 78.4MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:32,723 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.15ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.93ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.48ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 80.2MB in the end (delta: 854.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 134.80ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 71.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1586.73ms. Allocated memory is still 155.2MB. Free memory was 71.5MB in the beginning and 78.4MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 20 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 77ms VariablesStem: 0 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 107, Number of transitions in reduction automaton: 56, Number of states in reduction automaton: 42, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + -1 * x5 + -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:32,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...