/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:06,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:06,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:06,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:06,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:06,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:06,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:06,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:06,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:06,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:06,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:06,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:06,790 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:06,791 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:06,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:06,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:06,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:06,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:06,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:06,793 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:06,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:06,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:06,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:06,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:06,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:06,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:06,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:06,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:06,794 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:06,794 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:06,794 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:07,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:07,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:07,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:07,060 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:07,061 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:07,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl [2025-04-26 18:42:07,062 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl' [2025-04-26 18:42:07,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:07,079 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:07,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:07,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:07,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:07,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,113 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:07,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:07,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:07,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:07,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:07,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:07,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:07,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:07,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:07,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/1) ... [2025-04-26 18:42:07,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:07,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:07,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:07,192 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:07,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:07,192 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:07,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:07,193 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:07,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:07,193 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:07,232 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:07,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:07,335 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:07,335 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:07,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:07,344 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:07,345 INFO L201 PluginConnector]: Adding new model c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:07 BoogieIcfgContainer [2025-04-26 18:42:07,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:07,346 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:07,346 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:07,350 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:07,351 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:07,351 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:07" (1/2) ... [2025-04-26 18:42:07,353 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ef49f46 and model type c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:07, skipping insertion in model container [2025-04-26 18:42:07,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:07,353 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:07" (2/2) ... [2025-04-26 18:42:07,354 INFO L376 chiAutomizerObserver]: Analyzing ICFG c2-barrier-2t.c.bpl [2025-04-26 18:42:07,405 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:07,449 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:07,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:07,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:07,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:07,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:07,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 76 flow [2025-04-26 18:42:07,530 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-26 18:42:07,533 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:07,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 18:42:07,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 76 flow [2025-04-26 18:42:07,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 66 flow [2025-04-26 18:42:07,540 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 27 transitions, 66 flow [2025-04-26 18:42:07,541 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 27 transitions, 66 flow [2025-04-26 18:42:07,564 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 113 states, 112 states have (on average 2.169642857142857) internal successors, (in total 243), 112 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:07,565 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 113 states, 112 states have (on average 2.169642857142857) internal successors, (in total 243), 112 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:07,569 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:07,704 WARN L140 AmpleReduction]: Number of pruned transitions: 55 [2025-04-26 18:42:07,704 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:07,704 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 10 [2025-04-26 18:42:07,704 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:53 [2025-04-26 18:42:07,704 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:47 [2025-04-26 18:42:07,704 WARN L145 AmpleReduction]: Times succ was already a loop node:27 [2025-04-26 18:42:07,704 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:12 [2025-04-26 18:42:07,704 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:07,705 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 111 states, 110 states have (on average 1.6727272727272726) internal successors, (in total 184), 110 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:07,710 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:07,710 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:07,710 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:07,710 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:07,710 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:07,710 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:07,710 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:07,711 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:07,712 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 110 states have (on average 1.6727272727272726) internal successors, (in total 184), 110 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:07,722 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 75 [2025-04-26 18:42:07,722 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:07,722 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:07,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:07,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:07,725 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:07,725 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 110 states have (on average 1.6727272727272726) internal successors, (in total 184), 110 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:07,729 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 75 [2025-04-26 18:42:07,729 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:07,729 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:07,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:07,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:07,733 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:07,733 INFO L754 eck$LassoCheckResult]: Loop: "[69] L22-->L24: Formula: (< (+ v_x4_1 v_x1_1) v_z_2) InVars {x4=v_x4_1, x1=v_x1_1, z=v_z_2} OutVars{x4=v_x4_1, x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[73] L25-->L22: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:07,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash 3036, now seen corresponding path program 1 times [2025-04-26 18:42:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:07,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666959212] [2025-04-26 18:42:07,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:07,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:07,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 98374, now seen corresponding path program 1 times [2025-04-26 18:42:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:07,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765980734] [2025-04-26 18:42:07,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:07,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:07,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:07,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:07,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:07,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:07,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:07,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 90514059, now seen corresponding path program 1 times [2025-04-26 18:42:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:07,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485730313] [2025-04-26 18:42:07,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:07,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:07,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:07,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:07,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:07,915 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:07,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:07,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:07,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:07,916 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:07,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:07,917 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:07,917 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:07,917 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:07,917 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:07,917 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:07,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:07,999 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,000 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:08,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:08,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:08,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:08,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:08,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,126 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:08,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:08,134 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:08,134 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:08,134 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:08,134 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:08,134 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:08,134 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,135 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:08,135 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:08,135 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:08,135 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:08,135 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:08,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:08,171 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,183 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:08,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:08,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:08,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:08,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:08,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:08,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:08,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:08,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:08,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:08,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:08,242 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:08,242 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:08,248 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:08,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:08,252 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:08,252 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:08,252 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1, x4) = 1*z - 1*x1 - 1*x4 Supporting invariants [] [2025-04-26 18:42:08,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:08,262 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:08,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:08,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:08,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:08,384 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:08,388 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 111 states, 110 states have (on average 1.6727272727272726) internal successors, (in total 184), 110 states have internal predecessors, (184), 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:42:08,490 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 111 states, 110 states have (on average 1.6727272727272726) internal successors, (in total 184), 110 states have internal predecessors, (184), 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 241 states and 421 transitions. Complement of second has 6 states. [2025-04-26 18:42:08,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 18:42:08,497 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:42:08,498 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,498 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:08,498 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,498 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:42:08,498 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 421 transitions. [2025-04-26 18:42:08,505 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 58 [2025-04-26 18:42:08,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 147 states and 259 transitions. [2025-04-26 18:42:08,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 18:42:08,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2025-04-26 18:42:08,510 INFO L74 IsDeterministic]: Start isDeterministic. Operand 147 states and 259 transitions. [2025-04-26 18:42:08,512 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:08,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 259 transitions. [2025-04-26 18:42:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 259 transitions. [2025-04-26 18:42:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2025-04-26 18:42:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.7518796992481203) internal successors, (in total 233), 132 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 233 transitions. [2025-04-26 18:42:08,538 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 233 transitions. [2025-04-26 18:42:08,538 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 233 transitions. [2025-04-26 18:42:08,538 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:08,538 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 233 transitions. [2025-04-26 18:42:08,540 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 58 [2025-04-26 18:42:08,540 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:08,540 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:08,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:08,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:08,540 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:08,540 INFO L754 eck$LassoCheckResult]: Loop: "[80] L39-->L41: Formula: (< (+ v_x5_5 v_x3_5) v_z_6) InVars {x5=v_x5_5, x3=v_x3_5, z=v_z_6} OutVars{x5=v_x5_5, x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[82] L41-->L42: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[84] L42-->L39: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-04-26 18:42:08,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,541 INFO L85 PathProgramCache]: Analyzing trace with hash 94210, now seen corresponding path program 1 times [2025-04-26 18:42:08,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964918565] [2025-04-26 18:42:08,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash 109297, now seen corresponding path program 1 times [2025-04-26 18:42:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852200481] [2025-04-26 18:42:08,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1488277680, now seen corresponding path program 1 times [2025-04-26 18:42:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207076885] [2025-04-26 18:42:08,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:08,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:08,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,556 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:08,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:08,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,577 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:08,577 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:08,577 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:08,577 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:08,577 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:08,577 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,577 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:08,577 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:08,577 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:08,577 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:08,577 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:08,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:08,599 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,599 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:08,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:08,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:08,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:08,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:08,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,718 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:08,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:08,723 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:08,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:08,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:08,723 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:08,723 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:08,723 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,723 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:08,723 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:08,723 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:08,723 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:08,723 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:08,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:08,755 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,755 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:08,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,757 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:08,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:08,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:08,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:08,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:08,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:08,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:08,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:08,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:08,774 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:08,777 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:08,777 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:08,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:08,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:08,781 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:08,785 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:42:08,785 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:08,785 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:08,786 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:08,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:08,795 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:08,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:08,861 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:08,861 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 233 transitions. cyclomatic complexity: 124 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:08,954 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 233 transitions. cyclomatic complexity: 124. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 367 states and 684 transitions. Complement of second has 7 states. [2025-04-26 18:42:08,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 18:42:08,959 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:42:08,959 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,959 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:42:08,959 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,959 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:42:08,959 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 684 transitions. [2025-04-26 18:42:08,969 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 13 [2025-04-26 18:42:08,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 226 states and 435 transitions. [2025-04-26 18:42:08,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-04-26 18:42:08,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-04-26 18:42:08,973 INFO L74 IsDeterministic]: Start isDeterministic. Operand 226 states and 435 transitions. [2025-04-26 18:42:08,973 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:08,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 226 states and 435 transitions. [2025-04-26 18:42:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 435 transitions. [2025-04-26 18:42:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 203. [2025-04-26 18:42:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 203 states have (on average 1.9852216748768472) internal successors, (in total 403), 202 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 403 transitions. [2025-04-26 18:42:08,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 203 states and 403 transitions. [2025-04-26 18:42:08,985 INFO L438 stractBuchiCegarLoop]: Abstraction has 203 states and 403 transitions. [2025-04-26 18:42:08,985 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:08,985 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 403 transitions. [2025-04-26 18:42:08,989 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 13 [2025-04-26 18:42:08,989 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:08,989 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:08,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:08,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:08,989 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[72] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:08,989 INFO L754 eck$LassoCheckResult]: Loop: "[75] L29-1-->L31: Formula: (< (+ v_x5_2 v_x3_2) v_z_4) InVars {x5=v_x5_2, x3=v_x3_2, z=v_z_4} OutVars{x5=v_x5_2, x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[77] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[78] L32-->L29-1: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 18:42:08,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash 90513066, now seen corresponding path program 1 times [2025-04-26 18:42:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512657200] [2025-04-26 18:42:08,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:08,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:08,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:09,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:09,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512657200] [2025-04-26 18:42:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512657200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:09,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:09,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659955666] [2025-04-26 18:42:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:09,039 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:09,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash 104331, now seen corresponding path program 1 times [2025-04-26 18:42:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:09,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2207837] [2025-04-26 18:42:09,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:09,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:09,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:09,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:09,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:09,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:09,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:09,072 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:09,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:09,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:09,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:09,072 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:09,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:09,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:09,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:09,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:09,072 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:09,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:09,092 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:09,092 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:09,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,094 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:09,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:09,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:09,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:09,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,116 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:09,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:09,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:09,203 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:09,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:09,208 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:09,208 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:09,208 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:09,208 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:09,208 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:09,208 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,208 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:09,208 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:09,208 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:09,208 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:09,208 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:09,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:09,238 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:09,238 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:09,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:09,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:09,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:09,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:09,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:09,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:09,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:09,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:09,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:09,261 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:09,261 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:09,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,263 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:09,267 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:09,270 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:09,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:09,271 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:09,271 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:09,271 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:09,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:09,278 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:09,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:09,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:09,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:09,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:09,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:09,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:09,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:09,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:09,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:09,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:09,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:09,342 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:09,342 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 403 transitions. cyclomatic complexity: 225 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:09,412 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 403 transitions. cyclomatic complexity: 225. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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 436 states and 937 transitions. Complement of second has 7 states. [2025-04-26 18:42:09,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-26 18:42:09,413 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:09,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:09,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:09,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:09,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:09,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:09,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 436 states and 937 transitions. [2025-04-26 18:42:09,418 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:09,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 436 states to 296 states and 587 transitions. [2025-04-26 18:42:09,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2025-04-26 18:42:09,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2025-04-26 18:42:09,426 INFO L74 IsDeterministic]: Start isDeterministic. Operand 296 states and 587 transitions. [2025-04-26 18:42:09,426 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:09,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 296 states and 587 transitions. [2025-04-26 18:42:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states and 587 transitions. [2025-04-26 18:42:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 205. [2025-04-26 18:42:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 205 states have (on average 1.9609756097560975) internal successors, (in total 402), 204 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 402 transitions. [2025-04-26 18:42:09,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 205 states and 402 transitions. [2025-04-26 18:42:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:42:09,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:42:09,436 INFO L87 Difference]: Start difference. First operand 205 states and 402 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:09,465 INFO L93 Difference]: Finished difference Result 91 states and 161 transitions. [2025-04-26 18:42:09,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 161 transitions. [2025-04-26 18:42:09,466 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:09,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 161 transitions. [2025-04-26 18:42:09,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-04-26 18:42:09,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-04-26 18:42:09,467 INFO L74 IsDeterministic]: Start isDeterministic. Operand 91 states and 161 transitions. [2025-04-26 18:42:09,467 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:09,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 161 transitions. [2025-04-26 18:42:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 161 transitions. [2025-04-26 18:42:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-26 18:42:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.7692307692307692) internal successors, (in total 161), 90 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 161 transitions. [2025-04-26 18:42:09,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 161 transitions. [2025-04-26 18:42:09,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:42:09,476 INFO L438 stractBuchiCegarLoop]: Abstraction has 91 states and 161 transitions. [2025-04-26 18:42:09,476 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:09,476 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 161 transitions. [2025-04-26 18:42:09,477 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:09,477 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:09,477 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:09,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:09,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:09,478 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[94] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] L39-->L44: Formula: (<= v_z_7 (+ v_x5_8 v_x3_8)) InVars {x5=v_x5_8, x3=v_x3_8, z=v_z_7} OutVars{x5=v_x5_8, x3=v_x3_8, z=v_z_7} AuxVars[] AssignedVars[]" "[81] L44-->L45: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[72] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[74] L29-1-->thread1FINAL: Formula: (<= v_z_1 (+ v_x5_1 v_x3_1)) InVars {x5=v_x5_1, x3=v_x3_1, z=v_z_1} OutVars{x5=v_x5_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[83] L45-->L46-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:09,478 INFO L754 eck$LassoCheckResult]: Loop: "[86] L46-1-->L48: Formula: (< v_x1_6 v_z_8) InVars {x1=v_x1_6, z=v_z_8} OutVars{x1=v_x1_6, z=v_z_8} AuxVars[] AssignedVars[]" "[88] L48-->L46-1: Formula: (= v_x1_7 (+ v_x1_8 1)) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:09,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 255804335, now seen corresponding path program 1 times [2025-04-26 18:42:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:09,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306572137] [2025-04-26 18:42:09,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:09,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:09,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:09,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:09,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:09,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:09,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:09,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-04-26 18:42:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:09,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609556322] [2025-04-26 18:42:09,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:09,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:09,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:09,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:09,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:09,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:09,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:09,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:09,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1014832817, now seen corresponding path program 1 times [2025-04-26 18:42:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:09,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789192744] [2025-04-26 18:42:09,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:09,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:09,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:09,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:09,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:09,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:09,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:09,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:09,517 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:09,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:09,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:09,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:09,517 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:09,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:09,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:09,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:09,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:09,517 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:09,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:09,531 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:09,531 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:09,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:09,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:09,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:09,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,554 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:09,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:09,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:09,620 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:09,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:09,624 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:09,624 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:09,624 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:09,624 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:09,624 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:09,624 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:09,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:09,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:09,625 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:09,625 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:09,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:09,641 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:09,641 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:09,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,644 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:09,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:09,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:09,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:09,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:09,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:09,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:09,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:09,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:09,658 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:09,660 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:09,660 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:09,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:09,662 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:09,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:09,664 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:09,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:42:09,667 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:09,667 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:09,667 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:09,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:09,673 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:09,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:09,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:09,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:09,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:09,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:09,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:09,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:09,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:09,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:09,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:09,704 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:09,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:09,718 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:09,718 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 161 transitions. cyclomatic complexity: 83 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:09,749 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 161 transitions. cyclomatic complexity: 83. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 113 states and 192 transitions. Complement of second has 6 states. [2025-04-26 18:42:09,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-26 18:42:09,751 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:42:09,751 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:09,751 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:42:09,751 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:09,751 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:42:09,751 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:09,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 192 transitions. [2025-04-26 18:42:09,752 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:09,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 0 states and 0 transitions. [2025-04-26 18:42:09,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:09,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:09,752 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:09,752 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:09,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:09,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:09,752 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:09,752 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:09,752 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:09,752 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:09,752 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:09,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:09,766 INFO L201 PluginConnector]: Adding new model c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:09 BoogieIcfgContainer [2025-04-26 18:42:09,766 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:09,767 INFO L158 Benchmark]: Toolchain (without parser) took 2687.85ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 76.3MB in the beginning and 64.6MB in the end (delta: 11.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:09,767 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 142.6MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:09,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.29ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:09,767 INFO L158 Benchmark]: Boogie Preprocessor took 25.52ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 73.3MB in the end (delta: 983.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:09,767 INFO L158 Benchmark]: RCFGBuilder took 204.16ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 64.1MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:09,768 INFO L158 Benchmark]: BuchiAutomizer took 2420.25ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 64.1MB in the beginning and 64.6MB in the end (delta: -547.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:09,770 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.22ms. Allocated memory is still 142.6MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.29ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.52ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 73.3MB in the end (delta: 983.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 204.16ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 64.1MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2420.25ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 64.1MB in the beginning and 64.6MB in the end (delta: -547.8kB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 128 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 100 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf93 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 68ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 260, Number of transitions in reduction automaton: 184, Number of states in reduction automaton: 111, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:09,783 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...