/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/4_plus_thr/pp5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:44:16,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:44:16,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:44:16,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:44:16,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:44:16,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:44:16,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:44:16,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:44:16,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:44:16,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:44:16,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:44:16,174 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:44:16,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:44:16,174 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:44:16,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:44:16,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:44:16,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:44:16,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:16,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:44:16,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:44:16,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:44:16,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:44:16,177 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:44:16,177 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:44:16,177 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:44:16,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:44:16,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:44:16,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:44:16,425 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:44:16,425 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:44:16,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/pp5.c.bpl [2025-04-26 18:44:16,427 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/pp5.c.bpl' [2025-04-26 18:44:16,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:44:16,446 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:44:16,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:16,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:44:16,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:44:16,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,478 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:44:16,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:16,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:44:16,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:44:16,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:44:16,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:44:16,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:44:16,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:44:16,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:44:16,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/1) ... [2025-04-26 18:44:16,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:16,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:16,536 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:44:16,543 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:44:16,570 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:44:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:44:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:44:16,571 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:44:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:44:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:44:16,571 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:44:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:44:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:44:16,571 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:44:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:44:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:44:16,571 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:44:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:44:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:44:16,571 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:44:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:44:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:44:16,572 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:44:16,617 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:44:16,619 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:44:16,702 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:44:16,702 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:44:16,712 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:44:16,712 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:44:16,713 INFO L201 PluginConnector]: Adding new model pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:16 BoogieIcfgContainer [2025-04-26 18:44:16,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:44:16,714 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:44:16,714 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:44:16,719 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:44:16,719 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:16,719 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:16" (1/2) ... [2025-04-26 18:44:16,720 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c4de121 and model type pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:44:16, skipping insertion in model container [2025-04-26 18:44:16,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:16,721 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:16" (2/2) ... [2025-04-26 18:44:16,722 INFO L376 chiAutomizerObserver]: Analyzing ICFG pp5.c.bpl [2025-04-26 18:44:16,798 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:44:16,846 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:44:16,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:44:16,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:16,849 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:44:16,851 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:44:16,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 18:44:16,946 INFO L116 PetriNetUnfolderBase]: 5/42 cut-off events. [2025-04-26 18:44:16,947 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:44:16,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 42 events. 5/42 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-04-26 18:44:16,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 18:44:16,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 114 flow [2025-04-26 18:44:16,958 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 42 transitions, 114 flow [2025-04-26 18:44:16,959 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 42 transitions, 114 flow [2025-04-26 18:44:17,505 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10888 states, 10887 states have (on average 4.942775787636631) internal successors, (in total 53812), 10887 states have internal predecessors, (53812), 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:44:17,552 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 10888 states, 10887 states have (on average 4.942775787636631) internal successors, (in total 53812), 10887 states have internal predecessors, (53812), 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:44:17,555 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:44:18,618 WARN L140 AmpleReduction]: Number of pruned transitions: 30207 [2025-04-26 18:44:18,618 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:44:18,618 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 2693 [2025-04-26 18:44:18,619 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 18:44:18,619 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8157 [2025-04-26 18:44:18,619 WARN L145 AmpleReduction]: Times succ was already a loop node:1443 [2025-04-26 18:44:18,619 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6444 [2025-04-26 18:44:18,619 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:44:18,646 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 10888 states, 10887 states have (on average 2.168182235693947) internal successors, (in total 23605), 10887 states have internal predecessors, (23605), 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:44:18,654 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:44:18,654 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:44:18,654 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:44:18,654 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:44:18,654 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:44:18,654 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:44:18,654 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:44:18,654 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:44:18,677 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10888 states, 10887 states have (on average 2.168182235693947) internal successors, (in total 23605), 10887 states have internal predecessors, (23605), 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:44:18,930 INFO L131 ngComponentsAnalysis]: Automaton has 806 accepting balls. 8094 [2025-04-26 18:44:18,930 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:18,930 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:18,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:18,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:18,936 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:44:18,954 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10888 states, 10887 states have (on average 2.168182235693947) internal successors, (in total 23605), 10887 states have internal predecessors, (23605), 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:44:19,125 INFO L131 ngComponentsAnalysis]: Automaton has 806 accepting balls. 8094 [2025-04-26 18:44:19,125 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:19,125 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:19,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:19,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:19,131 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 18:44:19,132 INFO L754 eck$LassoCheckResult]: Loop: "[100] L32-->L34: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[102] L34-->L35: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[104] L35-->L32: Formula: (= (+ v_c_2 1) v_c_1) InVars {c=v_c_2} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" [2025-04-26 18:44:19,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 3823, now seen corresponding path program 1 times [2025-04-26 18:44:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:19,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770137541] [2025-04-26 18:44:19,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:19,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:19,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:19,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:19,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:19,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:19,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:19,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:19,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash 129157, now seen corresponding path program 1 times [2025-04-26 18:44:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:19,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887655568] [2025-04-26 18:44:19,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:19,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:19,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:19,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:19,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:19,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:19,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:19,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:19,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:19,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash 113990359, now seen corresponding path program 1 times [2025-04-26 18:44:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:19,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527121682] [2025-04-26 18:44:19,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:19,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:19,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:19,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:19,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:19,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:19,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:19,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:19,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:19,321 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:19,322 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:19,322 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:19,322 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:19,322 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:19,322 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:19,322 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:19,322 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:19,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:19,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:19,323 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:19,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:19,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:19,461 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:19,463 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:19,466 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:44:19,468 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:44:19,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:19,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:19,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:19,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:19,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:19,533 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:44:19,535 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:44:19,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:19,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:19,634 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:19,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:44:19,643 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:19,643 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:19,643 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:19,643 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:19,643 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:19,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:19,643 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:19,643 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:19,643 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:19,643 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:19,643 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:19,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:19,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:19,690 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:19,693 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:19,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:19,696 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:44:19,698 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:44:19,700 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:44:19,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:19,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:19,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:19,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:19,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:19,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:19,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:19,722 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:19,729 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:19,729 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:19,755 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:44:19,758 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:44:19,758 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:19,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:44:19,763 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:19,763 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:19,764 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-04-26 18:44:19,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:19,774 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:19,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:19,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:19,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:19,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:19,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:19,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:19,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:19,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:19,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:19,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:19,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:19,875 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:44:19,898 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:44:19,917 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10888 states, 10887 states have (on average 2.168182235693947) internal successors, (in total 23605), 10887 states have internal predecessors, (23605), 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.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:44:20,397 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10888 states, 10887 states have (on average 2.168182235693947) internal successors, (in total 23605), 10887 states have internal predecessors, (23605), 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.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 22294 states and 48766 transitions. Complement of second has 6 states. [2025-04-26 18:44:20,398 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:44:20,403 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:44:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-04-26 18:44:20,411 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:44:20,411 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:20,412 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:44:20,412 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:20,412 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:44:20,412 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:20,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22294 states and 48766 transitions. [2025-04-26 18:44:20,667 INFO L131 ngComponentsAnalysis]: Automaton has 465 accepting balls. 3429 [2025-04-26 18:44:20,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22294 states to 13720 states and 29711 transitions. [2025-04-26 18:44:20,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6841 [2025-04-26 18:44:20,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8807 [2025-04-26 18:44:20,993 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13720 states and 29711 transitions. [2025-04-26 18:44:20,993 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:20,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13720 states and 29711 transitions. [2025-04-26 18:44:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13720 states and 29711 transitions. [2025-04-26 18:44:21,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13720 to 12737. [2025-04-26 18:44:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12737 states, 12737 states have (on average 2.2554761717829943) internal successors, (in total 28728), 12736 states have internal predecessors, (28728), 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:44:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 28728 transitions. [2025-04-26 18:44:21,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12737 states and 28728 transitions. [2025-04-26 18:44:21,494 INFO L438 stractBuchiCegarLoop]: Abstraction has 12737 states and 28728 transitions. [2025-04-26 18:44:21,494 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:44:21,495 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12737 states and 28728 transitions. [2025-04-26 18:44:21,559 INFO L131 ngComponentsAnalysis]: Automaton has 465 accepting balls. 3429 [2025-04-26 18:44:21,559 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:21,559 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:21,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:44:21,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:21,560 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" [2025-04-26 18:44:21,560 INFO L754 eck$LassoCheckResult]: Loop: "[106] L43-->L45: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[108] L45-->L46: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[110] L46-->L43: Formula: (= (+ v_c_4 1) v_c_3) InVars {c=v_c_4} OutVars{c=v_c_3} AuxVars[] AssignedVars[c]" [2025-04-26 18:44:21,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash -761296813, now seen corresponding path program 1 times [2025-04-26 18:44:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:21,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302265295] [2025-04-26 18:44:21,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:21,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:21,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:21,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:21,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:21,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:21,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:21,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:21,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash 135115, now seen corresponding path program 1 times [2025-04-26 18:44:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:21,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603905817] [2025-04-26 18:44:21,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:21,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:21,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:21,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:21,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:21,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:21,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:21,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1929039417, now seen corresponding path program 1 times [2025-04-26 18:44:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:21,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598839553] [2025-04-26 18:44:21,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:21,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:21,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:21,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:21,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:21,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:21,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:21,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:21,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:21,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:21,637 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:21,638 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:21,638 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:21,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:21,638 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:21,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:21,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:21,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:21,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:21,638 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:21,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:21,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:21,671 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:21,671 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:21,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:21,673 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:44:21,675 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:44:21,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:21,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:21,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:21,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:21,697 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:44:21,697 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:44:21,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:21,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:21,734 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:44:21,734 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 18:44:21,740 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:44:21,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:21,743 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:44:21,743 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:44:21,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:21,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:21,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:21,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:21,769 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:44:21,770 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:44:21,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:21,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:21,840 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:21,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:21,845 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:21,845 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:21,845 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:21,845 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:21,845 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:21,845 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:21,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:21,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:21,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:21,845 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:21,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:21,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:21,878 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:21,878 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:21,880 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:44:21,882 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:44:21,883 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:44:21,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:21,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:21,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:21,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:21,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:21,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:21,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:21,896 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:44:21,901 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:44:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:21,905 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:44:21,906 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:44:21,907 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:44:21,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:21,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:21,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:21,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:21,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:21,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:21,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:21,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:21,925 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:21,925 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:21,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:21,927 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:44:21,929 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:44:21,930 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:21,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:21,933 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:21,933 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:21,933 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 18:44:21,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:44:21,940 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:21,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:21,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:21,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:21,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:21,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:21,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:21,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:21,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:21,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:21,982 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:21,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:22,014 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:44:22,014 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:44:22,015 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12737 states and 28728 transitions. cyclomatic complexity: 16716 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:44:22,351 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12737 states and 28728 transitions. cyclomatic complexity: 16716. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 28323 states and 63240 transitions. Complement of second has 6 states. [2025-04-26 18:44:22,352 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:44:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:44:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-26 18:44:22,353 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:44:22,353 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:22,353 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 18:44:22,353 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:22,353 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 18:44:22,353 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:22,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28323 states and 63240 transitions. [2025-04-26 18:44:22,624 INFO L131 ngComponentsAnalysis]: Automaton has 231 accepting balls. 1227 [2025-04-26 18:44:22,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28323 states to 18113 states and 40390 transitions. [2025-04-26 18:44:22,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6939 [2025-04-26 18:44:22,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8044 [2025-04-26 18:44:22,817 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18113 states and 40390 transitions. [2025-04-26 18:44:22,817 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:22,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18113 states and 40390 transitions. [2025-04-26 18:44:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18113 states and 40390 transitions. [2025-04-26 18:44:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18113 to 17071. [2025-04-26 18:44:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17071 states, 17071 states have (on average 2.2527678519126004) internal successors, (in total 38457), 17070 states have internal predecessors, (38457), 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:44:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17071 states to 17071 states and 38457 transitions. [2025-04-26 18:44:23,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17071 states and 38457 transitions. [2025-04-26 18:44:23,457 INFO L438 stractBuchiCegarLoop]: Abstraction has 17071 states and 38457 transitions. [2025-04-26 18:44:23,457 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:23,457 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17071 states and 38457 transitions. [2025-04-26 18:44:23,520 INFO L131 ngComponentsAnalysis]: Automaton has 231 accepting balls. 1227 [2025-04-26 18:44:23,520 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:23,520 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:23,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:23,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:23,521 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[105] L43-->L48: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[107] L48-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[109] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" [2025-04-26 18:44:23,521 INFO L754 eck$LassoCheckResult]: Loop: "[112] L54-->L56: Formula: (< v_y1_1 v_z1_3) InVars {y1=v_y1_1, z1=v_z1_3} OutVars{y1=v_y1_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[114] L56-->L57: Formula: (= v_y1_2 (+ v_y1_3 1)) InVars {y1=v_y1_3} OutVars{y1=v_y1_2} AuxVars[] AssignedVars[y1]" "[116] L57-->L54: Formula: (= v_c_5 (+ v_c_6 1)) InVars {c=v_c_6} OutVars{c=v_c_5} AuxVars[] AssignedVars[c]" [2025-04-26 18:44:23,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash -329350860, now seen corresponding path program 1 times [2025-04-26 18:44:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:23,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100529743] [2025-04-26 18:44:23,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:23,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:23,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:23,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:23,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:23,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:23,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:23,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash 141073, now seen corresponding path program 1 times [2025-04-26 18:44:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:23,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108700241] [2025-04-26 18:44:23,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:23,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:23,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:23,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:23,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:23,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:23,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:23,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1986054914, now seen corresponding path program 1 times [2025-04-26 18:44:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:23,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792507458] [2025-04-26 18:44:23,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:23,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:23,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:23,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:23,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:23,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:23,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:23,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:23,582 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:23,583 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:23,583 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:23,583 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:23,583 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:23,583 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,583 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:23,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:23,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:23,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:23,583 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:23,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:23,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:23,613 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:23,613 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:23,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,615 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:44:23,617 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:44:23,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:23,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:23,635 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:44:23,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,638 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:44:23,639 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:44:23,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:23,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:23,673 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:44:23,673 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 18:44:23,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,680 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:44:23,682 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:44:23,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:23,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:23,701 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:44:23,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,703 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:44:23,705 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:44:23,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:23,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:23,772 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:23,776 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:44:23,777 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:23,777 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:23,777 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:23,777 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:23,777 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:23,777 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,777 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:23,777 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:23,777 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:23,777 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:23,777 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:23,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:23,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:23,809 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:23,809 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:23,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,811 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:44:23,813 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:44:23,814 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:44:23,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:23,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:23,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:23,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:23,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:23,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:23,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:23,826 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:44:23,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:23,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,833 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:44:23,835 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:44:23,835 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:44:23,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:23,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:23,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:23,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:23,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:23,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:23,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:23,847 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:23,850 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:23,850 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:23,852 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:44:23,854 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:44:23,855 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:23,860 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:44:23,860 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:23,861 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:23,861 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, z1) = -1*y1 + 1*z1 Supporting invariants [] [2025-04-26 18:44:23,869 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:44:23,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:23,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:23,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:23,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:23,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:23,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:23,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:23,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:23,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:23,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:23,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:23,949 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:44:23,950 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:44:23,950 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17071 states and 38457 transitions. cyclomatic complexity: 22119 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:44:24,332 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17071 states and 38457 transitions. cyclomatic complexity: 22119. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 40047 states and 89243 transitions. Complement of second has 6 states. [2025-04-26 18:44:24,333 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:44:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:44:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 18:44:24,334 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:44:24,334 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:24,334 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:44:24,334 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:24,334 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 18:44:24,334 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:24,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40047 states and 89243 transitions. [2025-04-26 18:44:24,733 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 387 [2025-04-26 18:44:25,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40047 states to 23356 states and 51572 transitions. [2025-04-26 18:44:25,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6779 [2025-04-26 18:44:25,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7296 [2025-04-26 18:44:25,100 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23356 states and 51572 transitions. [2025-04-26 18:44:25,100 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:25,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23356 states and 51572 transitions. [2025-04-26 18:44:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23356 states and 51572 transitions. [2025-04-26 18:44:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23356 to 22684. [2025-04-26 18:44:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22684 states, 22684 states have (on average 2.2289719626168223) internal successors, (in total 50562), 22683 states have internal predecessors, (50562), 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:44:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22684 states to 22684 states and 50562 transitions. [2025-04-26 18:44:25,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22684 states and 50562 transitions. [2025-04-26 18:44:25,723 INFO L438 stractBuchiCegarLoop]: Abstraction has 22684 states and 50562 transitions. [2025-04-26 18:44:25,723 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:25,723 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22684 states and 50562 transitions. [2025-04-26 18:44:25,808 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 387 [2025-04-26 18:44:25,808 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:25,808 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:25,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:25,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:25,809 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[105] L43-->L48: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[107] L48-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[109] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" "[111] L54-->L59: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[113] L59-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[115] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L19-->L65: Formula: (and (= v_thread4Thread1of1ForFork4_thidvar2_2 4) (= v_thread4Thread1of1ForFork4_thidvar0_2 4) (= v_thread4Thread1of1ForFork4_thidvar1_2 4) (= v_thread4Thread1of1ForFork4_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork4_thidvar0=v_thread4Thread1of1ForFork4_thidvar0_2, thread4Thread1of1ForFork4_thidvar1=v_thread4Thread1of1ForFork4_thidvar1_2, thread4Thread1of1ForFork4_thidvar2=v_thread4Thread1of1ForFork4_thidvar2_2, thread4Thread1of1ForFork4_thidvar3=v_thread4Thread1of1ForFork4_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork4_thidvar0, thread4Thread1of1ForFork4_thidvar1, thread4Thread1of1ForFork4_thidvar2, thread4Thread1of1ForFork4_thidvar3]" [2025-04-26 18:44:25,809 INFO L754 eck$LassoCheckResult]: Loop: "[118] L65-->L67: Formula: (< v_y2_1 v_z1_5) InVars {y2=v_y2_1, z1=v_z1_5} OutVars{y2=v_y2_1, z1=v_z1_5} AuxVars[] AssignedVars[]" "[120] L67-->L68: Formula: (= v_y2_2 (+ v_y2_3 1)) InVars {y2=v_y2_3} OutVars{y2=v_y2_2} AuxVars[] AssignedVars[y2]" "[122] L68-->L65: Formula: (= v_c_7 (+ v_c_8 1)) InVars {c=v_c_8} OutVars{c=v_c_7} AuxVars[] AssignedVars[c]" [2025-04-26 18:44:25,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1438190830, now seen corresponding path program 1 times [2025-04-26 18:44:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:25,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743449369] [2025-04-26 18:44:25,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:25,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:25,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:25,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:25,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:25,815 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:25,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:25,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:25,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:25,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:25,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:25,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash 147031, now seen corresponding path program 1 times [2025-04-26 18:44:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:25,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943087194] [2025-04-26 18:44:25,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:25,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:25,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:25,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:25,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:25,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:25,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:25,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:25,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:25,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:25,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:25,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1450845606, now seen corresponding path program 1 times [2025-04-26 18:44:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:25,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385610604] [2025-04-26 18:44:25,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:25,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:44:25,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:44:25,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:25,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:25,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:25,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:44:25,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:44:25,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:25,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:25,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:26,000 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:26,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:26,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:26,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:26,000 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:26,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:26,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:26,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:26,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:26,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:26,000 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:26,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:26,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:26,034 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:26,034 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:26,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:26,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:26,037 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:44:26,037 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:44:26,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:26,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:26,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:44:26,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:26,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:26,058 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:44:26,059 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:44:26,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:26,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:26,134 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:26,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:44:26,143 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:26,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:26,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:26,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:26,143 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:26,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:26,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:26,143 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:26,143 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:26,143 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:26,144 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:26,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:26,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:26,177 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:26,177 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:26,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:26,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:26,179 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:44:26,181 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:44:26,182 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:44:26,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:26,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:26,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:26,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:26,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:26,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:26,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:26,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:26,199 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:26,199 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:26,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:26,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:26,201 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:44:26,202 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:44:26,203 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:26,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:26,208 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:26,208 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:26,208 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, y2) = 1*z1 - 1*y2 Supporting invariants [] [2025-04-26 18:44:26,216 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:44:26,217 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:26,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:26,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:26,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:26,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:26,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:26,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:26,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:26,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:26,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:26,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:26,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:26,265 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:26,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:26,290 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:44:26,291 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:44:26,291 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22684 states and 50562 transitions. cyclomatic complexity: 28704 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:44:26,611 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22684 states and 50562 transitions. cyclomatic complexity: 28704. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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 53019 states and 116397 transitions. Complement of second has 6 states. [2025-04-26 18:44:26,611 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:44:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:44:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 18:44:26,612 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:44:26,612 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:26,612 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 18:44:26,612 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:26,613 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 18:44:26,613 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:26,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53019 states and 116397 transitions. [2025-04-26 18:44:27,124 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2025-04-26 18:44:27,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53019 states to 25404 states and 55297 transitions. [2025-04-26 18:44:27,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5931 [2025-04-26 18:44:27,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6166 [2025-04-26 18:44:27,292 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25404 states and 55297 transitions. [2025-04-26 18:44:27,293 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:27,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25404 states and 55297 transitions. [2025-04-26 18:44:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25404 states and 55297 transitions. [2025-04-26 18:44:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25404 to 24916. [2025-04-26 18:44:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24916 states, 24916 states have (on average 2.195496869481458) internal successors, (in total 54703), 24915 states have internal predecessors, (54703), 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:44:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24916 states to 24916 states and 54703 transitions. [2025-04-26 18:44:27,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24916 states and 54703 transitions. [2025-04-26 18:44:27,832 INFO L438 stractBuchiCegarLoop]: Abstraction has 24916 states and 54703 transitions. [2025-04-26 18:44:27,832 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:27,832 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24916 states and 54703 transitions. [2025-04-26 18:44:27,938 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2025-04-26 18:44:27,938 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:27,938 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:27,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:27,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:27,940 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[105] L43-->L48: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[107] L48-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[109] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" "[111] L54-->L59: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[113] L59-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[115] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L19-->L65: Formula: (and (= v_thread4Thread1of1ForFork4_thidvar2_2 4) (= v_thread4Thread1of1ForFork4_thidvar0_2 4) (= v_thread4Thread1of1ForFork4_thidvar1_2 4) (= v_thread4Thread1of1ForFork4_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork4_thidvar0=v_thread4Thread1of1ForFork4_thidvar0_2, thread4Thread1of1ForFork4_thidvar1=v_thread4Thread1of1ForFork4_thidvar1_2, thread4Thread1of1ForFork4_thidvar2=v_thread4Thread1of1ForFork4_thidvar2_2, thread4Thread1of1ForFork4_thidvar3=v_thread4Thread1of1ForFork4_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork4_thidvar0, thread4Thread1of1ForFork4_thidvar1, thread4Thread1of1ForFork4_thidvar2, thread4Thread1of1ForFork4_thidvar3]" "[117] L65-->L70: Formula: (<= v_z1_6 v_y2_4) InVars {y2=v_y2_4, z1=v_z1_6} OutVars{y2=v_y2_4, z1=v_z1_6} AuxVars[] AssignedVars[]" "[119] L70-->thread4FINAL: Formula: (= (+ v_f_9 1) v_f_8) InVars {f=v_f_9} OutVars{f=v_f_8} AuxVars[] AssignedVars[f]" "[121] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[131] L20-->L76: Formula: (and (= 5 v_thread5Thread1of1ForFork0_thidvar4_2) (= 5 v_thread5Thread1of1ForFork0_thidvar3_2) (= 5 v_thread5Thread1of1ForFork0_thidvar2_2) (= 5 v_thread5Thread1of1ForFork0_thidvar1_2) (= 5 v_thread5Thread1of1ForFork0_thidvar0_2)) InVars {} OutVars{thread5Thread1of1ForFork0_thidvar4=v_thread5Thread1of1ForFork0_thidvar4_2, thread5Thread1of1ForFork0_thidvar3=v_thread5Thread1of1ForFork0_thidvar3_2, thread5Thread1of1ForFork0_thidvar2=v_thread5Thread1of1ForFork0_thidvar2_2, thread5Thread1of1ForFork0_thidvar1=v_thread5Thread1of1ForFork0_thidvar1_2, thread5Thread1of1ForFork0_thidvar0=v_thread5Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_thidvar4, thread5Thread1of1ForFork0_thidvar3, thread5Thread1of1ForFork0_thidvar2, thread5Thread1of1ForFork0_thidvar1, thread5Thread1of1ForFork0_thidvar0]" [2025-04-26 18:44:27,940 INFO L754 eck$LassoCheckResult]: Loop: "[124] L76-->L78: Formula: (< v_x3_1 v_z1_7) InVars {x3=v_x3_1, z1=v_z1_7} OutVars{x3=v_x3_1, z1=v_z1_7} AuxVars[] AssignedVars[]" "[126] L78-->L79: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[128] L79-->L76: Formula: (= (+ v_c_10 1) v_c_9) InVars {c=v_c_10} OutVars{c=v_c_9} AuxVars[] AssignedVars[c]" [2025-04-26 18:44:27,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2026510174, now seen corresponding path program 1 times [2025-04-26 18:44:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:27,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360822787] [2025-04-26 18:44:27,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:27,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:44:27,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:44:27,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:27,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:27,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:27,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:44:27,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:44:27,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:27,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:27,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:27,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 152989, now seen corresponding path program 1 times [2025-04-26 18:44:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:27,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867779022] [2025-04-26 18:44:27,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:27,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:27,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:27,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:27,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:27,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:27,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:27,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:27,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:27,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:27,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:27,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1704404256, now seen corresponding path program 1 times [2025-04-26 18:44:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:27,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265153141] [2025-04-26 18:44:27,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:27,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:44:27,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:44:27,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:27,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:27,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:44:27,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:44:27,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:27,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:27,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:28,003 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:28,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:28,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:28,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:28,004 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:28,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:28,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:28,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:28,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:28,004 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:28,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:28,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:28,027 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:28,027 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:28,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,029 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:44:28,030 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:44:28,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:28,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:28,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:28,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,051 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:44:28,052 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:44:28,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:28,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:28,120 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:28,124 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:44:28,124 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:28,124 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:28,125 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:28,125 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:28,125 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:28,125 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,125 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:28,125 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:28,125 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:28,125 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:28,125 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:28,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:28,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:28,151 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:28,151 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:28,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,153 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:44:28,155 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:44:28,156 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:44:28,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:28,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:28,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:28,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:28,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:28,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:28,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:28,169 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:28,171 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:28,171 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:28,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,172 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:44:28,173 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:44:28,174 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:28,177 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:44:28,177 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:28,177 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:28,177 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-04-26 18:44:28,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:28,182 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:28,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:28,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:44:28,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:44:28,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:28,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:28,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:28,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:28,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:28,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:28,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:28,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:28,265 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:44:28,266 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:44:28,266 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24916 states and 54703 transitions. cyclomatic complexity: 30653 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 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:44:28,766 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24916 states and 54703 transitions. cyclomatic complexity: 30653. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 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 53107 states and 113525 transitions. Complement of second has 6 states. [2025-04-26 18:44:28,766 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:44:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 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:44:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-04-26 18:44:28,767 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 18:44:28,767 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:28,767 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 18:44:28,767 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:28,767 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 18:44:28,768 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:28,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53107 states and 113525 transitions. [2025-04-26 18:44:29,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:29,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53107 states to 0 states and 0 transitions. [2025-04-26 18:44:29,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:44:29,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:44:29,359 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:44:29,359 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:44:29,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:29,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:29,359 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:29,359 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:29,359 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:44:29,359 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:29,359 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:44:29,369 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:44:29,370 INFO L201 PluginConnector]: Adding new model pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:44:29 BoogieIcfgContainer [2025-04-26 18:44:29,371 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:44:29,371 INFO L158 Benchmark]: Toolchain (without parser) took 12925.78ms. Allocated memory was 159.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 87.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 675.1MB. Max. memory is 8.0GB. [2025-04-26 18:44:29,372 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:29,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.05ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.3MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:29,372 INFO L158 Benchmark]: Boogie Preprocessor took 23.98ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 84.3MB in the end (delta: 904.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:29,373 INFO L158 Benchmark]: RCFGBuilder took 207.39ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 74.5MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:44:29,373 INFO L158 Benchmark]: BuchiAutomizer took 12656.84ms. Allocated memory was 159.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 74.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 658.3MB. Max. memory is 8.0GB. [2025-04-26 18:44:29,375 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.23ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.05ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.3MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.98ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 84.3MB in the end (delta: 904.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 207.39ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 74.5MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 12656.84ms. Allocated memory was 159.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 74.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 658.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 2.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 3185 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 2.9s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 587 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 289 IncrementalHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 271 mSDtfsCounter, 289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 69ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 1.8s InitialAbstraction: Time to compute Ample Reduction [ms]: 1778, Number of transitions in reduction automaton: 23605, Number of states in reduction automaton: 10888, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 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:44:29,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...