/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/pc5v.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:44:08,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:44:08,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:44:08,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:44:08,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:44:08,487 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:08,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:44:08,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:44:08,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:44:08,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:44:08,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:44:08,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:44:08,510 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:44:08,510 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:44:08,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:44:08,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:44:08,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:08,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:44:08,512 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:44:08,513 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:44:08,513 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:44:08,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:44:08,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:44:08,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:44:08,750 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:44:08,751 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:44:08,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/pc5v.c.bpl [2025-04-26 18:44:08,753 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/pc5v.c.bpl' [2025-04-26 18:44:08,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:44:08,765 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:44:08,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:08,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:44:08,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:44:08,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,801 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:44:08,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:08,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:44:08,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:44:08,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:44:08,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:44:08,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:44:08,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:44:08,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:44:08,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/1) ... [2025-04-26 18:44:08,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,852 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:08,857 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:08,877 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:44:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:44:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:44:08,877 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:44:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:44:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:44:08,877 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:44:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:44:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:44:08,878 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:44:08,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:44:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:44:08,878 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:44:08,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:44:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:44:08,878 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:44:08,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:44:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:44:08,879 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:08,917 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:44:08,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:44:09,031 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:44:09,031 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:44:09,042 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:44:09,042 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:44:09,042 INFO L201 PluginConnector]: Adding new model pc5v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:09 BoogieIcfgContainer [2025-04-26 18:44:09,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:44:09,043 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:44:09,043 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:44:09,048 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:44:09,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:09,049 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:08" (1/2) ... [2025-04-26 18:44:09,050 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c5971ec and model type pc5v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:44:09, skipping insertion in model container [2025-04-26 18:44:09,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:09,050 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pc5v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:09" (2/2) ... [2025-04-26 18:44:09,051 INFO L376 chiAutomizerObserver]: Analyzing ICFG pc5v.c.bpl [2025-04-26 18:44:09,118 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:44:09,153 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:44:09,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:44:09,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,157 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:09,158 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:09,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 18:44:09,227 INFO L116 PetriNetUnfolderBase]: 5/42 cut-off events. [2025-04-26 18:44:09,228 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:44:09,232 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 8. Compared 115 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:09,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 18:44:09,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 114 flow [2025-04-26 18:44:09,236 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 42 transitions, 114 flow [2025-04-26 18:44:09,236 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 42 transitions, 114 flow [2025-04-26 18:44:09,730 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:09,799 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:09,802 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:44:10,865 WARN L140 AmpleReduction]: Number of pruned transitions: 30204 [2025-04-26 18:44:10,866 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:44:10,866 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 2693 [2025-04-26 18:44:10,866 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:36 [2025-04-26 18:44:10,866 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8154 [2025-04-26 18:44:10,866 WARN L145 AmpleReduction]: Times succ was already a loop node:1443 [2025-04-26 18:44:10,866 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6458 [2025-04-26 18:44:10,866 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:44:10,894 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 10884 states, 10883 states have (on average 2.1686115960672607) internal successors, (in total 23601), 10883 states have internal predecessors, (23601), 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:10,902 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:44:10,902 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:44:10,903 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:44:10,903 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:44:10,903 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:44:10,903 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:44:10,903 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:44:10,903 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:44:10,924 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10884 states, 10883 states have (on average 2.1686115960672607) internal successors, (in total 23601), 10883 states have internal predecessors, (23601), 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:11,156 INFO L131 ngComponentsAnalysis]: Automaton has 806 accepting balls. 8094 [2025-04-26 18:44:11,156 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:11,156 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:11,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:11,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:11,162 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:44:11,181 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10884 states, 10883 states have (on average 2.1686115960672607) internal successors, (in total 23601), 10883 states have internal predecessors, (23601), 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:11,337 INFO L131 ngComponentsAnalysis]: Automaton has 806 accepting balls. 8094 [2025-04-26 18:44:11,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:11,338 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:11,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:11,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:11,343 INFO L752 eck$LassoCheckResult]: Stem: "[91] $Ultimate##0-->L15: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[135] L15-->L30: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 18:44:11,343 INFO L754 eck$LassoCheckResult]: Loop: "[101] L30-->L32: 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[]" "[103] L32-->L33: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[105] L33-->L30: 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:11,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 3917, now seen corresponding path program 1 times [2025-04-26 18:44:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352943975] [2025-04-26 18:44:11,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:11,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:11,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 130150, now seen corresponding path program 1 times [2025-04-26 18:44:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982864043] [2025-04-26 18:44:11,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:11,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:11,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:11,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:11,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:11,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:11,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash 116791706, now seen corresponding path program 1 times [2025-04-26 18:44:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44965806] [2025-04-26 18:44:11,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:11,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:11,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:11,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:11,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:11,516 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,517 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:11,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:11,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,518 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,609 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,610 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:11,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,613 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:11,614 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:11,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:11,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,661 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:11,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,669 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:11,670 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:11,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:11,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,790 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:11,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:11,795 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,796 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,796 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,796 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,796 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:11,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,796 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,796 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,796 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:11,796 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,796 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,834 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,839 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:11,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,842 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:11,845 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:11,846 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:11,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:11,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:11,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:11,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:11,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:11,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:11,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:11,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:11,874 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:11,875 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:11,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,880 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:11,882 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:11,882 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:11,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:11,886 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:11,886 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:11,887 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 18:44:11,893 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:11,895 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:11,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:11,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:11,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,952 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:12,015 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:12,030 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:12,047 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10884 states, 10883 states have (on average 2.1686115960672607) internal successors, (in total 23601), 10883 states have internal predecessors, (23601), 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:12,392 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10884 states, 10883 states have (on average 2.1686115960672607) internal successors, (in total 23601), 10883 states have internal predecessors, (23601), 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 22286 states and 48758 transitions. Complement of second has 6 states. [2025-04-26 18:44:12,393 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:12,396 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:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-04-26 18:44:12,401 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:44:12,401 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:12,401 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:44:12,403 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:12,403 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:44:12,404 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:12,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22286 states and 48758 transitions. [2025-04-26 18:44:12,743 INFO L131 ngComponentsAnalysis]: Automaton has 465 accepting balls. 3429 [2025-04-26 18:44:12,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22286 states to 13981 states and 30242 transitions. [2025-04-26 18:44:12,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6976 [2025-04-26 18:44:12,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8978 [2025-04-26 18:44:12,908 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13981 states and 30242 transitions. [2025-04-26 18:44:12,908 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:12,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13981 states and 30242 transitions. [2025-04-26 18:44:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13981 states and 30242 transitions. [2025-04-26 18:44:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13981 to 12980. [2025-04-26 18:44:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12980 states, 12980 states have (on average 2.252773497688752) internal successors, (in total 29241), 12979 states have internal predecessors, (29241), 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:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12980 states to 12980 states and 29241 transitions. [2025-04-26 18:44:13,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12980 states and 29241 transitions. [2025-04-26 18:44:13,420 INFO L438 stractBuchiCegarLoop]: Abstraction has 12980 states and 29241 transitions. [2025-04-26 18:44:13,420 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:44:13,420 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12980 states and 29241 transitions. [2025-04-26 18:44:13,485 INFO L131 ngComponentsAnalysis]: Automaton has 465 accepting balls. 3429 [2025-04-26 18:44:13,485 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:13,485 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:13,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:44:13,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:13,486 INFO L752 eck$LassoCheckResult]: Stem: "[91] $Ultimate##0-->L15: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[135] L15-->L30: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[100] L30-->L35: 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[]" "[102] L35-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[104] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] L15-1-->L41: 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:13,486 INFO L754 eck$LassoCheckResult]: Loop: "[107] L41-->L43: 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[]" "[109] L43-->L44: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[111] L44-->L41: 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:13,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash -674455055, now seen corresponding path program 1 times [2025-04-26 18:44:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:13,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261463722] [2025-04-26 18:44:13,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:13,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:13,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:13,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:13,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:13,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:13,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:13,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash 136108, now seen corresponding path program 1 times [2025-04-26 18:44:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:13,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324823537] [2025-04-26 18:44:13,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:13,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:13,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:13,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:13,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:13,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash -833426500, now seen corresponding path program 1 times [2025-04-26 18:44:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:13,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198223672] [2025-04-26 18:44:13,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:13,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:13,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:13,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:13,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:13,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:13,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:13,555 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:13,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:13,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:13,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:13,556 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:13,556 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,556 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:13,556 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:13,556 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:13,556 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:13,556 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:13,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:13,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:13,588 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:13,588 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,593 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:13,594 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:13,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:13,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:13,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:44:13,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,620 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:13,622 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:13,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:13,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:13,667 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:44:13,668 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:13,676 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:13,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,678 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:13,680 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:13,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:13,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:13,699 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:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,702 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:13,704 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:13,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:13,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:13,771 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:13,776 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:13,777 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:13,777 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:13,777 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:13,777 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:13,777 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:13,777 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,777 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:13,777 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:13,778 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:13,778 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:13,778 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:13,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:13,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:13,811 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:13,811 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:13,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,814 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:13,816 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:13,816 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:13,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:13,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:13,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:13,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:13,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:13,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:13,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:13,830 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:44:13,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:44:13,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,838 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:13,840 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:13,841 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:13,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:13,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:13,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:13,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:13,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:13,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:13,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:13,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:13,859 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:13,859 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:13,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,861 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:13,862 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:13,864 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:13,867 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:13,867 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:13,867 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:13,867 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 18:44:13,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:13,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:13,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:13,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:13,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:13,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:13,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:13,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:13,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:13,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:13,971 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:13,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:14,003 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:14,004 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:14,005 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12980 states and 29241 transitions. cyclomatic complexity: 17013 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:14,371 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12980 states and 29241 transitions. cyclomatic complexity: 17013. 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 28827 states and 64308 transitions. Complement of second has 6 states. [2025-04-26 18:44:14,372 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:14,372 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:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-26 18:44:14,373 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:44:14,373 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:14,373 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 18:44:14,373 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:14,373 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 18:44:14,373 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:14,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28827 states and 64308 transitions. [2025-04-26 18:44:14,753 INFO L131 ngComponentsAnalysis]: Automaton has 231 accepting balls. 1227 [2025-04-26 18:44:14,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28827 states to 18830 states and 41971 transitions. [2025-04-26 18:44:14,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7215 [2025-04-26 18:44:14,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8365 [2025-04-26 18:44:14,969 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18830 states and 41971 transitions. [2025-04-26 18:44:14,969 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:14,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18830 states and 41971 transitions. [2025-04-26 18:44:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18830 states and 41971 transitions. [2025-04-26 18:44:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18830 to 17746. [2025-04-26 18:44:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17746 states, 17746 states have (on average 2.2517750478981178) internal successors, (in total 39960), 17745 states have internal predecessors, (39960), 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:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17746 states to 17746 states and 39960 transitions. [2025-04-26 18:44:15,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17746 states and 39960 transitions. [2025-04-26 18:44:15,519 INFO L438 stractBuchiCegarLoop]: Abstraction has 17746 states and 39960 transitions. [2025-04-26 18:44:15,519 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:15,519 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17746 states and 39960 transitions. [2025-04-26 18:44:15,589 INFO L131 ngComponentsAnalysis]: Automaton has 231 accepting balls. 1227 [2025-04-26 18:44:15,589 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:15,589 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:15,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:15,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:15,591 INFO L752 eck$LassoCheckResult]: Stem: "[91] $Ultimate##0-->L15: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[135] L15-->L30: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[100] L30-->L35: 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[]" "[102] L35-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[104] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] L15-1-->L41: 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]" "[106] L41-->L46: 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[]" "[108] L46-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[110] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] L16-->L52: 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:15,591 INFO L754 eck$LassoCheckResult]: Loop: "[113] L52-->L54: 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[]" "[115] L54-->L55: Formula: (= v_y1_2 (+ v_y1_3 1)) InVars {y1=v_y1_3} OutVars{y1=v_y1_2} AuxVars[] AssignedVars[y1]" "[117] L55-->L52: 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:15,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash -66448366, now seen corresponding path program 1 times [2025-04-26 18:44:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:15,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36893977] [2025-04-26 18:44:15,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:15,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:15,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:15,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:15,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:15,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:15,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:15,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:15,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash 142066, now seen corresponding path program 1 times [2025-04-26 18:44:15,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:15,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881764967] [2025-04-26 18:44:15,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:15,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:15,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:15,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:15,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:15,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:15,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:15,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:15,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:15,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 416764225, now seen corresponding path program 1 times [2025-04-26 18:44:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:15,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427808403] [2025-04-26 18:44:15,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:15,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:15,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:15,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:15,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:15,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:15,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:15,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:15,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:15,648 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:15,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:15,648 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:15,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:15,648 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:15,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:15,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:15,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:15,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:15,648 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:15,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:15,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:15,674 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:15,674 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:15,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:15,677 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:15,678 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:15,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:15,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:15,700 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:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:15,702 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:15,703 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:15,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:15,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:15,738 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:44:15,738 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:15,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:44:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:15,747 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:15,748 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:15,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:15,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:15,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:15,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:15,768 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:15,769 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:15,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:15,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:15,835 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:15,840 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:15,840 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:15,840 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:15,840 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:15,840 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:15,840 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:15,840 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,840 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:15,840 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:15,840 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:15,840 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:15,840 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:15,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:15,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:15,872 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:15,872 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:15,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:15,875 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:15,877 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:15,878 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:15,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:15,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:15,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:15,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:15,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:15,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:15,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:15,894 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:44:15,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:44:15,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:15,903 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:15,904 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:15,906 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:15,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:15,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:15,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:15,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:15,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:15,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:15,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:15,919 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:15,923 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:15,923 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:15,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:15,928 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:15,929 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:15,930 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:15,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:15,934 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:15,934 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:15,934 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, z1) = -1*y1 + 1*z1 Supporting invariants [] [2025-04-26 18:44:15,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:15,941 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:15,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:15,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:15,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:15,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:15,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:15,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:15,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:15,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:15,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:15,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:15,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:16,016 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:16,016 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:16,017 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17746 states and 39960 transitions. cyclomatic complexity: 23028 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:16,503 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17746 states and 39960 transitions. cyclomatic complexity: 23028. 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 41559 states and 92647 transitions. Complement of second has 6 states. [2025-04-26 18:44:16,503 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:16,504 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:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 18:44:16,504 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:44:16,505 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:16,505 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:44:16,505 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:16,505 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 18:44:16,505 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:16,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41559 states and 92647 transitions. [2025-04-26 18:44:16,843 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 387 [2025-04-26 18:44:17,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41559 states to 25462 states and 56233 transitions. [2025-04-26 18:44:17,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7389 [2025-04-26 18:44:17,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7954 [2025-04-26 18:44:17,093 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25462 states and 56233 transitions. [2025-04-26 18:44:17,093 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:17,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25462 states and 56233 transitions. [2025-04-26 18:44:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25462 states and 56233 transitions. [2025-04-26 18:44:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25462 to 24728. [2025-04-26 18:44:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24728 states, 24728 states have (on average 2.229375606599806) internal successors, (in total 55128), 24727 states have internal predecessors, (55128), 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,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24728 states to 24728 states and 55128 transitions. [2025-04-26 18:44:17,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24728 states and 55128 transitions. [2025-04-26 18:44:17,677 INFO L438 stractBuchiCegarLoop]: Abstraction has 24728 states and 55128 transitions. [2025-04-26 18:44:17,677 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:17,677 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24728 states and 55128 transitions. [2025-04-26 18:44:17,784 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 387 [2025-04-26 18:44:17,784 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:17,784 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:17,785 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:17,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:17,786 INFO L752 eck$LassoCheckResult]: Stem: "[91] $Ultimate##0-->L15: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[135] L15-->L30: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[100] L30-->L35: 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[]" "[102] L35-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[104] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] L15-1-->L41: 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]" "[106] L41-->L46: 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[]" "[108] L46-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[110] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] L16-->L52: 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]" "[112] L52-->L57: 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[]" "[114] L57-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[116] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[144] L17-->L63: 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:17,786 INFO L754 eck$LassoCheckResult]: Loop: "[119] L63-->L65: Formula: (< v_x3_1 v_z1_5) InVars {x3=v_x3_1, z1=v_z1_5} OutVars{x3=v_x3_1, z1=v_z1_5} AuxVars[] AssignedVars[]" "[121] L65-->L66: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[123] L66-->L63: 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:17,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash 34758448, now seen corresponding path program 1 times [2025-04-26 18:44:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:17,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920748441] [2025-04-26 18:44:17,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:17,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:17,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:17,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:17,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:17,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:17,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:17,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash 148024, now seen corresponding path program 1 times [2025-04-26 18:44:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:17,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161176693] [2025-04-26 18:44:17,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:17,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:17,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:17,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:17,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:17,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:17,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:17,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash 401924265, now seen corresponding path program 1 times [2025-04-26 18:44:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:17,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202993157] [2025-04-26 18:44:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:17,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:44:17,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:44:17,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:17,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:44:17,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:44:17,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:17,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:17,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:17,843 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:17,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:17,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:17,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:17,844 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:17,844 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,844 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:17,844 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:17,844 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:17,844 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:17,844 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:17,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:17,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:17,871 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:17,871 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:17,873 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:17,875 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:17,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:17,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:17,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:17,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:17,896 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:17,898 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:17,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:17,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:17,965 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:17,969 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:17,969 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:17,969 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:17,969 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:17,969 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:17,969 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:17,969 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:17,970 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:17,970 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:17,970 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:17,970 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:17,970 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:17,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:17,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:18,001 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:18,001 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:18,004 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:18,005 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:18,007 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:18,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:18,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:18,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:18,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:18,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:18,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:18,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:18,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:18,027 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:18,027 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:18,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:18,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:18,030 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:18,030 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:18,031 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:18,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:44:18,038 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:18,038 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:18,038 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z1) = -1*x3 + 1*z1 Supporting invariants [] [2025-04-26 18:44:18,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:18,045 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:18,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:18,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:18,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:18,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:18,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:18,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:18,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:18,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:18,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:18,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:18,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:18,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:18,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:18,123 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:18,124 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:18,124 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24728 states and 55128 transitions. cyclomatic complexity: 31418 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:18,711 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24728 states and 55128 transitions. cyclomatic complexity: 31418. 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 57667 states and 126810 transitions. Complement of second has 6 states. [2025-04-26 18:44:18,715 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:18,716 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:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 18:44:18,716 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:44:18,717 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:18,717 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 18:44:18,717 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:18,717 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 18:44:18,717 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:18,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57667 states and 126810 transitions. [2025-04-26 18:44:19,177 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2025-04-26 18:44:19,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57667 states to 31755 states and 69189 transitions. [2025-04-26 18:44:19,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7395 [2025-04-26 18:44:19,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7682 [2025-04-26 18:44:19,518 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31755 states and 69189 transitions. [2025-04-26 18:44:19,518 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:19,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31755 states and 69189 transitions. [2025-04-26 18:44:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31755 states and 69189 transitions. [2025-04-26 18:44:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31755 to 31152. [2025-04-26 18:44:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31152 states, 31152 states have (on average 2.197290703646636) internal successors, (in total 68450), 31151 states have internal predecessors, (68450), 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,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31152 states to 31152 states and 68450 transitions. [2025-04-26 18:44:20,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31152 states and 68450 transitions. [2025-04-26 18:44:20,163 INFO L438 stractBuchiCegarLoop]: Abstraction has 31152 states and 68450 transitions. [2025-04-26 18:44:20,163 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:20,163 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31152 states and 68450 transitions. [2025-04-26 18:44:20,321 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2025-04-26 18:44:20,322 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:20,322 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:20,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:20,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:44:20,324 INFO L752 eck$LassoCheckResult]: Stem: "[91] $Ultimate##0-->L15: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[135] L15-->L30: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[100] L30-->L35: 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[]" "[102] L35-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[104] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] L15-1-->L41: 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]" "[106] L41-->L46: 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[]" "[108] L46-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[110] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] L16-->L52: 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]" "[112] L52-->L57: 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[]" "[114] L57-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[116] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[144] L17-->L63: 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]" "[118] L63-->L68: Formula: (<= v_z1_6 v_x3_4) InVars {x3=v_x3_4, z1=v_z1_6} OutVars{x3=v_x3_4, z1=v_z1_6} AuxVars[] AssignedVars[]" "[120] L68-->thread4FINAL: Formula: (= (+ v_f_9 1) v_f_8) InVars {f=v_f_9} OutVars{f=v_f_8} AuxVars[] AssignedVars[f]" "[122] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] L18-->$Ultimate##0: 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]" "[124] $Ultimate##0-->L75-1: Formula: (< 3 v_f_10) InVars {f=v_f_10} OutVars{f=v_f_10} AuxVars[] AssignedVars[]" [2025-04-26 18:44:20,324 INFO L754 eck$LassoCheckResult]: Loop: "[126] L75-1-->L77: Formula: (< v_y2_1 v_z2_3) InVars {z2=v_z2_3, y2=v_y2_1} OutVars{z2=v_z2_3, y2=v_y2_1} AuxVars[] AssignedVars[]" "[128] L77-->L78: Formula: (= v_y2_2 (+ v_y2_3 1)) InVars {y2=v_y2_3} OutVars{y2=v_y2_2} AuxVars[] AssignedVars[y2]" "[129] L78-->L75-1: Formula: (= (+ v_c_9 1) v_c_10) InVars {c=v_c_10} OutVars{c=v_c_9} AuxVars[] AssignedVars[c]" [2025-04-26 18:44:20,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -298788032, now seen corresponding path program 1 times [2025-04-26 18:44:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:20,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528427818] [2025-04-26 18:44:20,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:20,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:44:20,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:44:20,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:20,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:20,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:44:20,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:44:20,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:20,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:20,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 1 times [2025-04-26 18:44:20,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:20,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753920626] [2025-04-26 18:44:20,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:20,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:20,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:20,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:20,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:20,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:20,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:20,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:20,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:20,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:20,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2021898817, now seen corresponding path program 1 times [2025-04-26 18:44:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:20,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519804924] [2025-04-26 18:44:20,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:20,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:44:20,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:44:20,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:20,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:20,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:44:20,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:44:20,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:20,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:20,403 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:20,403 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:20,404 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:20,404 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:20,404 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:20,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,404 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:20,404 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:20,404 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:20,404 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:20,404 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:20,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:20,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:20,429 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:20,430 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:20,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:20,436 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:20,437 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:20,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:20,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:20,455 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:20,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:20,457 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:20,459 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:20,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:20,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:20,487 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:44:20,487 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=0}, {c=7}, {c=-8}] Lambdas: [0, 1, 1] Nus: [0, 0] [2025-04-26 18:44:20,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:44:20,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:20,497 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:20,498 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:20,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:20,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:20,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:44:20,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:20,519 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:20,520 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:20,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:20,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:20,580 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:20,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:20,584 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:20,584 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:20,584 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:20,584 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:20,585 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:20,585 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,585 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:20,585 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:20,585 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc5v.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:20,585 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:20,585 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:20,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:20,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:20,615 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:20,615 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:20,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:20,617 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:20,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:44:20,620 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:20,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:20,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:20,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:20,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:20,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:20,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:20,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:20,631 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:44:20,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:20,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:20,639 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:20,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:44:20,641 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:20,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:20,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:20,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:20,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:20,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:20,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:20,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:20,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:20,658 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:20,658 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:20,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:20,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:20,660 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:20,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:44:20,662 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:20,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:44:20,665 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:20,666 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:20,666 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, z2) = -1*y2 + 1*z2 Supporting invariants [] [2025-04-26 18:44:20,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:20,672 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:20,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:20,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:44:20,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:44:20,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:20,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:20,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:20,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:44:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:44:20,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:20,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:20,731 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:20,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:20,757 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:20,757 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:20,758 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31152 states and 68450 transitions. cyclomatic complexity: 38588 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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,272 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31152 states and 68450 transitions. cyclomatic complexity: 38588. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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 59560 states and 127793 transitions. Complement of second has 6 states. [2025-04-26 18:44:21,272 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:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-04-26 18:44:21,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 19 letters. Loop has 3 letters. [2025-04-26 18:44:21,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:21,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 22 letters. Loop has 3 letters. [2025-04-26 18:44:21,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:21,274 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 19 letters. Loop has 6 letters. [2025-04-26 18:44:21,274 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:21,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59560 states and 127793 transitions. [2025-04-26 18:44:21,786 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:21,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59560 states to 0 states and 0 transitions. [2025-04-26 18:44:21,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:44:21,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:44:21,786 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:44:21,786 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:44:21,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:21,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:21,786 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:21,786 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:21,786 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:44:21,786 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:21,786 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:44:21,798 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:21,799 INFO L201 PluginConnector]: Adding new model pc5v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:44:21 BoogieIcfgContainer [2025-04-26 18:44:21,799 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:44:21,800 INFO L158 Benchmark]: Toolchain (without parser) took 13034.52ms. Allocated memory was 159.4MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 86.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 729.9MB. Max. memory is 8.0GB. [2025-04-26 18:44:21,800 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.77ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:21,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.73ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:21,800 INFO L158 Benchmark]: Boogie Preprocessor took 22.61ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:21,801 INFO L158 Benchmark]: RCFGBuilder took 214.11ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 74.0MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:44:21,801 INFO L158 Benchmark]: BuchiAutomizer took 12755.77ms. Allocated memory was 159.4MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 73.9MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 717.3MB. Max. memory is 8.0GB. [2025-04-26 18:44:21,802 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.77ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.73ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.61ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 214.11ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 74.0MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 12755.77ms. Allocated memory was 159.4MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 73.9MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 717.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.2s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 2.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 3422 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 2.9s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 288 mSDtfsCounter, 250 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: 46ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 1.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 1717, Number of transitions in reduction automaton: 23601, Number of states in reduction automaton: 10884, 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 * x3 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + z2 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:21,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...