/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/3_thr/seq_loops_part_indep_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:37,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:37,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:37,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:37,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:37,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:37,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:37,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:37,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:37,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:37,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:37,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:37,878 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:37,878 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:37,878 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:37,878 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:37,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:37,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:37,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:37,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:37,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:37,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:37,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:37,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:37,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:37,884 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:37,884 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:37,884 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:38,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:38,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:38,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:38,110 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:38,110 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:38,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/seq_loops_part_indep_3.c.bpl [2025-04-26 18:42:38,111 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/seq_loops_part_indep_3.c.bpl' [2025-04-26 18:42:38,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:38,123 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:38,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:38,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:38,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:38,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,159 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:38,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:38,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:38,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:38,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:38,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:38,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:38,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:38,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:38,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:38,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,214 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 18:42:38,219 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 18:42:38,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:38,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:38,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:38,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:38,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:38,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:38,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:38,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:38,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:38,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:38,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:38,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:38,243 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 18:42:38,276 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:38,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:38,353 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:38,353 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:38,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:38,361 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:38,361 INFO L201 PluginConnector]: Adding new model seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:38 BoogieIcfgContainer [2025-04-26 18:42:38,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:38,362 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:38,362 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:38,367 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:38,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:38,368 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/2) ... [2025-04-26 18:42:38,369 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dcc507f and model type seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:38, skipping insertion in model container [2025-04-26 18:42:38,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:38,369 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:38" (2/2) ... [2025-04-26 18:42:38,370 INFO L376 chiAutomizerObserver]: Analyzing ICFG seq_loops_part_indep_3.c.bpl [2025-04-26 18:42:38,430 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:38,477 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:38,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:38,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,482 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 18:42:38,483 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 18:42:38,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 37 transitions, 95 flow [2025-04-26 18:42:38,565 INFO L116 PetriNetUnfolderBase]: 6/31 cut-off events. [2025-04-26 18:42:38,567 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:38,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 6/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-26 18:42:38,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 95 flow [2025-04-26 18:42:38,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 31 transitions, 80 flow [2025-04-26 18:42:38,575 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 31 transitions, 80 flow [2025-04-26 18:42:38,576 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 31 transitions, 80 flow [2025-04-26 18:42:38,620 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 458 states, 457 states have (on average 3.350109409190372) internal successors, (in total 1531), 457 states have internal predecessors, (1531), 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 18:42:38,621 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 458 states, 457 states have (on average 3.350109409190372) internal successors, (in total 1531), 457 states have internal predecessors, (1531), 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 18:42:38,623 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:38,794 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 239#[L40, L13, L26]true [2025-04-26 18:42:38,794 WARN L140 AmpleReduction]: Number of pruned transitions: 499 [2025-04-26 18:42:38,794 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:42:38,794 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 140 [2025-04-26 18:42:38,794 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:35 [2025-04-26 18:42:38,794 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:241 [2025-04-26 18:42:38,794 WARN L145 AmpleReduction]: Times succ was already a loop node:193 [2025-04-26 18:42:38,794 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:104 [2025-04-26 18:42:38,794 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:38,796 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 416 states, 415 states have (on average 2.130120481927711) internal successors, (in total 884), 415 states have internal predecessors, (884), 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 18:42:38,804 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:38,804 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:38,804 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:38,805 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:38,805 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:38,805 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:38,805 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:38,805 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:38,807 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 416 states, 415 states have (on average 2.130120481927711) internal successors, (in total 884), 415 states have internal predecessors, (884), 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 18:42:38,830 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 387 [2025-04-26 18:42:38,830 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:38,833 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:38,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:38,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:38,836 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:38,837 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 416 states, 415 states have (on average 2.130120481927711) internal successors, (in total 884), 415 states have internal predecessors, (884), 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 18:42:38,886 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 387 [2025-04-26 18:42:38,886 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:38,886 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:38,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:38,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:38,892 INFO L752 eck$LassoCheckResult]: Stem: "[109] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:38,892 INFO L754 eck$LassoCheckResult]: Loop: "[84] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[87] L25-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[90] L26-->L23: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:38,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2025-04-26 18:42:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111954548] [2025-04-26 18:42:38,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:38,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:38,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:38,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:38,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 113302, now seen corresponding path program 1 times [2025-04-26 18:42:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31148476] [2025-04-26 18:42:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:38,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:38,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:38,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:38,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 4254251, now seen corresponding path program 1 times [2025-04-26 18:42:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425595753] [2025-04-26 18:42:38,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:38,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:38,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:38,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:38,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,041 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,042 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,042 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,042 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,042 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:39,042 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,042 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,042 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,043 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:39,043 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,043 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,137 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,137 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:39,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,141 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 18:42:39,143 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 18:42:39,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:39,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,166 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 18:42:39,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,169 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 18:42:39,170 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 18:42:39,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:39,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,243 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,248 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,248 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,248 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,248 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,249 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,249 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,249 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,249 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:39,249 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,249 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,293 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,300 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,305 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 18:42:39,316 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 18:42:39,318 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 18:42:39,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,359 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:39,366 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:39,366 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:39,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,374 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 18:42:39,376 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 18:42:39,376 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:39,379 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:39,380 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 18:42:39,380 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:39,381 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:39,381 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:39,390 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 18:42:39,392 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:39,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:39,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:39,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:39,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:39,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,436 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,488 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 18:42:39,506 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:39,508 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 416 states, 415 states have (on average 2.130120481927711) internal successors, (in total 884), 415 states have internal predecessors, (884), 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 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 18:42:39,634 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 416 states, 415 states have (on average 2.130120481927711) internal successors, (in total 884), 415 states have internal predecessors, (884), 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 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 898 states and 1979 transitions. Complement of second has 6 states. [2025-04-26 18:42:39,635 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 18:42:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 18:42:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 18:42:39,643 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 1 letters. Loop has 3 letters. [2025-04-26 18:42:39,643 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,643 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:42:39,643 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,644 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 1 letters. Loop has 6 letters. [2025-04-26 18:42:39,644 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 898 states and 1979 transitions. [2025-04-26 18:42:39,659 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 315 [2025-04-26 18:42:39,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 898 states to 563 states and 1214 transitions. [2025-04-26 18:42:39,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 357 [2025-04-26 18:42:39,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2025-04-26 18:42:39,674 INFO L74 IsDeterministic]: Start isDeterministic. Operand 563 states and 1214 transitions. [2025-04-26 18:42:39,674 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:39,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 563 states and 1214 transitions. [2025-04-26 18:42:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states and 1214 transitions. [2025-04-26 18:42:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 510. [2025-04-26 18:42:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 510 states have (on average 2.152941176470588) internal successors, (in total 1098), 509 states have internal predecessors, (1098), 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 18:42:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1098 transitions. [2025-04-26 18:42:39,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 510 states and 1098 transitions. [2025-04-26 18:42:39,722 INFO L438 stractBuchiCegarLoop]: Abstraction has 510 states and 1098 transitions. [2025-04-26 18:42:39,722 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:39,722 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 510 states and 1098 transitions. [2025-04-26 18:42:39,724 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 315 [2025-04-26 18:42:39,724 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:39,724 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:39,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:39,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:39,725 INFO L752 eck$LassoCheckResult]: Stem: "[109] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[112] L12-->L37: 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 18:42:39,725 INFO L754 eck$LassoCheckResult]: Loop: "[92] L37-->L39: Formula: (< v_x2_3 v_z_5) InVars {x2=v_x2_3, z=v_z_5} OutVars{x2=v_x2_3, z=v_z_5} AuxVars[] AssignedVars[]" "[95] L39-->L40: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[98] L40-->L37: Formula: (= v_x1_5 (+ v_x1_6 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:39,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 4452, now seen corresponding path program 1 times [2025-04-26 18:42:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469849429] [2025-04-26 18:42:39,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 121246, now seen corresponding path program 1 times [2025-04-26 18:42:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36229362] [2025-04-26 18:42:39,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:39,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:39,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:39,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:39,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash 132720987, now seen corresponding path program 1 times [2025-04-26 18:42:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364057499] [2025-04-26 18:42:39,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:39,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:39,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:39,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:39,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,763 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,763 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,763 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,763 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,763 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:39,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,765 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,766 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,766 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:39,766 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,766 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,796 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,796 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:39,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,798 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 18:42:39,799 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 18:42:39,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:39,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,816 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 18:42:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,818 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 18:42:39,818 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 18:42:39,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:39,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,845 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:39,845 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=7}, {x1=2}, {x1=-8}] Lambdas: [1, 5, 1] Nus: [0, 1] [2025-04-26 18:42:39,850 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-04-26 18:42:39,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,852 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 18:42:39,854 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 18:42:39,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:39,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,872 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 18:42:39,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,874 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 18:42:39,875 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 18:42:39,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:39,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,941 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,945 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-04-26 18:42:39,945 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,945 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,945 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,945 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,945 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,945 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,945 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,946 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,946 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:39,946 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,946 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,977 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,978 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,979 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-04-26 18:42:39,981 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-04-26 18:42:39,983 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 18:42:39,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,996 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:40,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,006 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-04-26 18:42:40,008 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-04-26 18:42:40,009 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 18:42:40,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,026 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:40,027 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,029 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-04-26 18:42:40,030 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-04-26 18:42:40,031 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:40,034 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-04-26 18:42:40,035 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:40,035 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:40,035 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:42:40,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,041 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:40,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,090 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 18:42:40,090 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:40,091 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 510 states and 1098 transitions. cyclomatic complexity: 683 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,175 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 510 states and 1098 transitions. cyclomatic complexity: 683. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1172 states and 2604 transitions. Complement of second has 6 states. [2025-04-26 18:42:40,176 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 18:42:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 18:42:40,176 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:42:40,177 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,177 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:40,177 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,177 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:42:40,177 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1172 states and 2604 transitions. [2025-04-26 18:42:40,185 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 225 [2025-04-26 18:42:40,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1172 states to 802 states and 1759 transitions. [2025-04-26 18:42:40,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2025-04-26 18:42:40,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2025-04-26 18:42:40,191 INFO L74 IsDeterministic]: Start isDeterministic. Operand 802 states and 1759 transitions. [2025-04-26 18:42:40,191 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 802 states and 1759 transitions. [2025-04-26 18:42:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states and 1759 transitions. [2025-04-26 18:42:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 734. [2025-04-26 18:42:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 734 states have (on average 2.2084468664850134) internal successors, (in total 1621), 733 states have internal predecessors, (1621), 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 18:42:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1621 transitions. [2025-04-26 18:42:40,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 734 states and 1621 transitions. [2025-04-26 18:42:40,228 INFO L438 stractBuchiCegarLoop]: Abstraction has 734 states and 1621 transitions. [2025-04-26 18:42:40,229 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:40,229 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 734 states and 1621 transitions. [2025-04-26 18:42:40,232 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 225 [2025-04-26 18:42:40,232 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,232 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,232 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:40,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,232 INFO L752 eck$LassoCheckResult]: Stem: "[109] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L23-->L28-1: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:40,233 INFO L754 eck$LassoCheckResult]: Loop: "[86] L28-1-->L30: 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[]" "[89] L30-->L28-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:40,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash 4423, now seen corresponding path program 1 times [2025-04-26 18:42:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683946762] [2025-04-26 18:42:40,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash 3716, now seen corresponding path program 1 times [2025-04-26 18:42:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645087333] [2025-04-26 18:42:40,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash 4253258, now seen corresponding path program 1 times [2025-04-26 18:42:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651870776] [2025-04-26 18:42:40,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:40,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:40,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:40,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:40,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,283 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,283 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,283 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,283 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:40,283 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,283 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,299 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,299 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,302 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-04-26 18:42:40,303 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-04-26 18:42:40,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:40,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,325 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-04-26 18:42:40,326 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-04-26 18:42:40,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,394 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:40,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:42:40,398 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:40,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,399 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,399 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:40,399 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,399 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,417 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,417 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:40,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,419 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-04-26 18:42:40,419 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-04-26 18:42:40,420 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 18:42:40,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,435 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:40,435 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:40,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,437 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-04-26 18:42:40,439 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-04-26 18:42:40,440 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:40,444 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-04-26 18:42:40,444 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:40,444 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:40,444 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:42:40,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:40,452 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:40,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,489 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 18:42:40,490 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 18:42:40,490 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 734 states and 1621 transitions. cyclomatic complexity: 1011 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 18:42:40,557 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 734 states and 1621 transitions. cyclomatic complexity: 1011. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 1577 states and 3792 transitions. Complement of second has 6 states. [2025-04-26 18:42:40,557 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 18:42:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 18:42:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-26 18:42:40,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:40,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:40,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:40,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1577 states and 3792 transitions. [2025-04-26 18:42:40,584 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 118 [2025-04-26 18:42:40,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1577 states to 1032 states and 2412 transitions. [2025-04-26 18:42:40,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2025-04-26 18:42:40,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 357 [2025-04-26 18:42:40,593 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1032 states and 2412 transitions. [2025-04-26 18:42:40,593 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,593 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1032 states and 2412 transitions. [2025-04-26 18:42:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states and 2412 transitions. [2025-04-26 18:42:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 913. [2025-04-26 18:42:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 913 states have (on average 2.388828039430449) internal successors, (in total 2181), 912 states have internal predecessors, (2181), 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 18:42:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 2181 transitions. [2025-04-26 18:42:40,611 INFO L240 hiAutomatonCegarLoop]: Abstraction has 913 states and 2181 transitions. [2025-04-26 18:42:40,611 INFO L438 stractBuchiCegarLoop]: Abstraction has 913 states and 2181 transitions. [2025-04-26 18:42:40,611 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:40,611 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 913 states and 2181 transitions. [2025-04-26 18:42:40,614 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 118 [2025-04-26 18:42:40,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,614 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:40,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:40,615 INFO L752 eck$LassoCheckResult]: Stem: "[109] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[112] L12-->L37: 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]" "[115] L13-->L51: 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-04-26 18:42:40,615 INFO L754 eck$LassoCheckResult]: Loop: "[100] L51-->L53: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[103] L53-->L54: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[106] L54-->L51: Formula: (= v_x1_7 (+ v_x1_8 1)) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:40,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 138127, now seen corresponding path program 1 times [2025-04-26 18:42:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566775045] [2025-04-26 18:42:40,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash 129190, now seen corresponding path program 1 times [2025-04-26 18:42:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385733754] [2025-04-26 18:42:40,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash -179926440, now seen corresponding path program 1 times [2025-04-26 18:42:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629478083] [2025-04-26 18:42:40,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:40,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:40,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:40,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:40,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,648 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,649 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,649 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,649 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,649 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,649 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:40,649 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,649 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,673 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,673 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,675 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-04-26 18:42:40,676 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-04-26 18:42:40,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,696 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-04-26 18:42:40,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,698 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-04-26 18:42:40,699 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-04-26 18:42:40,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,723 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:40,723 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=7}, {x1=2}, {x1=-8}] Lambdas: [1, 5, 1] Nus: [0, 1] [2025-04-26 18:42:40,729 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-04-26 18:42:40,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,731 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-04-26 18:42:40,732 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-04-26 18:42:40,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:42:40,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,751 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-04-26 18:42:40,752 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-04-26 18:42:40,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,816 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:40,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,820 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,820 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,820 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,820 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,820 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:40,820 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,820 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,820 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,820 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:40,820 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,820 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,854 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,854 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:40,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,856 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:42:40,859 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 18:42:40,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,871 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:40,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,878 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:42:40,880 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 18:42:40,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,896 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:40,896 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:40,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:42:40,901 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:40,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:42:40,905 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:40,905 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:40,905 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:42:40,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:42:40,911 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:40,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,962 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 18:42:40,963 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:40,963 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 913 states and 2181 transitions. cyclomatic complexity: 1391 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 18:42:41,043 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 913 states and 2181 transitions. cyclomatic complexity: 1391. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 2266 states and 5457 transitions. Complement of second has 6 states. [2025-04-26 18:42:41,044 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 18:42:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 18:42:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-04-26 18:42:41,045 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:42:41,045 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,045 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:42:41,045 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,045 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:42:41,045 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2266 states and 5457 transitions. [2025-04-26 18:42:41,062 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 82 [2025-04-26 18:42:41,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2266 states to 1529 states and 3668 transitions. [2025-04-26 18:42:41,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 346 [2025-04-26 18:42:41,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2025-04-26 18:42:41,074 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1529 states and 3668 transitions. [2025-04-26 18:42:41,074 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:41,074 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1529 states and 3668 transitions. [2025-04-26 18:42:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states and 3668 transitions. [2025-04-26 18:42:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1436. [2025-04-26 18:42:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1436 states have (on average 2.3997214484679668) internal successors, (in total 3446), 1435 states have internal predecessors, (3446), 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 18:42:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 3446 transitions. [2025-04-26 18:42:41,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1436 states and 3446 transitions. [2025-04-26 18:42:41,102 INFO L438 stractBuchiCegarLoop]: Abstraction has 1436 states and 3446 transitions. [2025-04-26 18:42:41,103 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:41,103 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1436 states and 3446 transitions. [2025-04-26 18:42:41,108 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 82 [2025-04-26 18:42:41,109 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:41,109 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:41,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:41,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:41,109 INFO L752 eck$LassoCheckResult]: Stem: "[109] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[112] L12-->L37: 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]" "[91] L37-->L42-1: Formula: (<= v_z_6 v_x2_6) InVars {x2=v_x2_6, z=v_z_6} OutVars{x2=v_x2_6, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:41,109 INFO L754 eck$LassoCheckResult]: Loop: "[94] L42-1-->L44: 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[]" "[97] L44-->L42-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:41,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash 138103, now seen corresponding path program 1 times [2025-04-26 18:42:41,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383965475] [2025-04-26 18:42:41,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:41,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:41,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:41,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:41,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash 3972, now seen corresponding path program 1 times [2025-04-26 18:42:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734274211] [2025-04-26 18:42:41,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 132719994, now seen corresponding path program 1 times [2025-04-26 18:42:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579856863] [2025-04-26 18:42:41,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:41,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:41,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,123 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:41,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:41,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,137 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,137 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,137 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,137 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,137 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:41,137 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,137 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,137 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,137 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:41,137 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,137 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,152 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,152 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,155 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:42:41,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:41,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:42:41,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,176 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:42:41,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:41,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,242 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,247 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,247 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,247 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,247 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,247 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,247 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,247 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,247 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,247 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:41,247 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,247 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,263 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,263 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,265 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:42:41,267 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 18:42:41,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,281 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:41,282 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:41,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,283 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:42:41,286 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,288 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:41,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:42:41,289 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,289 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,289 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:42:41,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:42:41,296 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:41,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:41,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,345 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 18:42:41,345 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 18:42:41,345 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1436 states and 3446 transitions. cyclomatic complexity: 2195 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,426 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1436 states and 3446 transitions. cyclomatic complexity: 2195. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2526 states and 6111 transitions. Complement of second has 6 states. [2025-04-26 18:42:41,427 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 18:42:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 18:42:41,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:41,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:41,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:42:41,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2526 states and 6111 transitions. [2025-04-26 18:42:41,443 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 18:42:41,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2526 states to 1593 states and 3869 transitions. [2025-04-26 18:42:41,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2025-04-26 18:42:41,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-04-26 18:42:41,454 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1593 states and 3869 transitions. [2025-04-26 18:42:41,454 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:41,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1593 states and 3869 transitions. [2025-04-26 18:42:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states and 3869 transitions. [2025-04-26 18:42:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1498. [2025-04-26 18:42:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1498 states have (on average 2.425233644859813) internal successors, (in total 3633), 1497 states have internal predecessors, (3633), 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 18:42:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 3633 transitions. [2025-04-26 18:42:41,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1498 states and 3633 transitions. [2025-04-26 18:42:41,483 INFO L438 stractBuchiCegarLoop]: Abstraction has 1498 states and 3633 transitions. [2025-04-26 18:42:41,483 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:41,484 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1498 states and 3633 transitions. [2025-04-26 18:42:41,489 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 18:42:41,489 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:41,489 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:41,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:41,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:41,490 INFO L752 eck$LassoCheckResult]: Stem: "[109] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[112] L12-->L37: 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]" "[115] L13-->L51: 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]" "[99] L51-->L56-1: Formula: (<= v_z_10 v_x5_4) InVars {x5=v_x5_4, z=v_z_10} OutVars{x5=v_x5_4, z=v_z_10} AuxVars[] AssignedVars[]" [2025-04-26 18:42:41,490 INFO L754 eck$LassoCheckResult]: Loop: "[102] L56-1-->L58: Formula: (< v_x6_1 v_z_11) InVars {x6=v_x6_1, z=v_z_11} OutVars{x6=v_x6_1, z=v_z_11} AuxVars[] AssignedVars[]" "[105] L58-->L56-1: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-04-26 18:42:41,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash 4282036, now seen corresponding path program 1 times [2025-04-26 18:42:41,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561494123] [2025-04-26 18:42:41,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:41,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:41,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:41,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:41,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 4228, now seen corresponding path program 1 times [2025-04-26 18:42:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807440703] [2025-04-26 18:42:41,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash -179927433, now seen corresponding path program 1 times [2025-04-26 18:42:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124955182] [2025-04-26 18:42:41,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:41,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:41,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:41,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:41,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,527 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,527 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,527 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,527 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,527 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:41,527 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,527 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,527 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,527 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:41,527 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,528 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,541 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,541 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:41,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,543 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:42:41,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:41,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,564 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:42:41,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:41,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,629 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,634 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,634 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,634 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_part_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:41,634 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,634 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,646 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,646 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,648 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:42:41,650 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 18:42:41,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,668 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:41,668 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,670 INFO L229 MonitoredProcess]: Starting monitored process 32 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 18:42:41,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:42:41,673 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:42:41,676 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,676 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,676 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-04-26 18:42:41,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:42:41,682 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:41,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:41,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,710 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,720 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 18:42:41,721 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 18:42:41,721 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1498 states and 3633 transitions. cyclomatic complexity: 2300 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 18:42:41,782 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1498 states and 3633 transitions. cyclomatic complexity: 2300. 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 2143 states and 5089 transitions. Complement of second has 6 states. [2025-04-26 18:42:41,783 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 18:42:41,784 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 18:42:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-04-26 18:42:41,784 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:41,784 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,784 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:41,784 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,784 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:41,784 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2143 states and 5089 transitions. [2025-04-26 18:42:41,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:41,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2143 states to 0 states and 0 transitions. [2025-04-26 18:42:41,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:41,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:41,795 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:41,795 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:41,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:41,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:41,795 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:41,795 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:41,795 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:41,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:41,796 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:41,807 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 18:42:41,808 INFO L201 PluginConnector]: Adding new model seq_loops_part_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:41 BoogieIcfgContainer [2025-04-26 18:42:41,808 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:41,809 INFO L158 Benchmark]: Toolchain (without parser) took 3685.24ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 70.3MB in the end (delta: 25.3MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. [2025-04-26 18:42:41,809 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:41,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.31ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 93.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:41,810 INFO L158 Benchmark]: Boogie Preprocessor took 27.45ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 92.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:41,812 INFO L158 Benchmark]: RCFGBuilder took 172.76ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 83.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:41,812 INFO L158 Benchmark]: BuchiAutomizer took 3445.94ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 70.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2025-04-26 18:42:41,813 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 167.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.31ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 93.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.45ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 92.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 172.76ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 83.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3445.94ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 70.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 428 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 176 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp85 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 79ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 323, Number of transitions in reduction automaton: 884, Number of states in reduction automaton: 416, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 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 18:42:41,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...