/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 ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:25,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:25,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:25,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:25,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:25,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:25,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:25,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:25,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:25,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:25,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:25,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:25,591 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:25,591 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:25,591 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:25,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:25,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:25,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:25,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:25,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:25,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:25,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:25,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:25,593 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:25,593 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:25,593 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:25,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:25,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:25,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:25,826 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:25,826 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:25,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-4.wvr.bpl [2025-04-26 16:54:25,828 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-4.wvr.bpl' [2025-04-26 16:54:25,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:25,852 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:25,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:25,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:25,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:25,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,889 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:25,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:25,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:25,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:25,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:25,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:25,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:25,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:25,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:25,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/1) ... [2025-04-26 16:54:25,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:25,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:25,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:25,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:25,975 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:25,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:25,975 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:25,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:25,975 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:25,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:25,976 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:26,024 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:26,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:26,146 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:26,146 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:26,219 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:26,219 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:54:26,221 INFO L201 PluginConnector]: Adding new model unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:26 BoogieIcfgContainer [2025-04-26 16:54:26,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:26,221 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:26,221 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:26,227 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:26,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:26,228 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:25" (1/2) ... [2025-04-26 16:54:26,229 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f8dabfb and model type unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:26, skipping insertion in model container [2025-04-26 16:54:26,230 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:26,230 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:26" (2/2) ... [2025-04-26 16:54:26,231 INFO L376 chiAutomizerObserver]: Analyzing ICFG unroll-cond-4.wvr.bpl [2025-04-26 16:54:26,273 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:54:26,316 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:26,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:26,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:26,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:26,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 16:54:26,430 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-26 16:54:26,435 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:54:26,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2025-04-26 16:54:26,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 16:54:26,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 42 flow [2025-04-26 16:54:26,444 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 15 transitions, 42 flow [2025-04-26 16:54:26,450 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:26,498 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39#[thread1EXIT, L33, L61]true [2025-04-26 16:54:26,498 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29#[L20, L60-1]true [2025-04-26 16:54:26,501 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 37#[thread1FINAL, L33, L61]true [2025-04-26 16:54:26,501 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33#[L61, L33, L20]true [2025-04-26 16:54:26,502 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 61#[thread2FINAL, L61, L20]true [2025-04-26 16:54:26,504 WARN L140 AmpleReduction]: Number of pruned transitions: 4 [2025-04-26 16:54:26,504 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 16:54:26,504 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 16:54:26,504 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 16:54:26,505 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8 [2025-04-26 16:54:26,505 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:54:26,505 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:26,505 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:26,507 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:26,516 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:26,516 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:26,516 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:26,516 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:26,516 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:26,517 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:26,517 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:26,517 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:26,519 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:26,534 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 16:54:26,534 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:26,534 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:26,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:26,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:26,539 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:26,540 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:26,541 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 16:54:26,541 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:26,542 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:26,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:26,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:26,548 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L60: Formula: (and (= v_i1_5 v_x2_16) (= v_i1_5 0) (= v_i1_5 v_i2_20) (= v_i1_5 v_x1_4)) InVars {i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} OutVars{i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} AuxVars[] AssignedVars[]" "[76] L60-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:54:26,548 INFO L754 eck$LassoCheckResult]: Loop: "[69] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (= (select v_f_11 v_x1_10) v_x1_9) (< v_i1_11 v_n_11)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_11, f=v_f_11} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_11, f=v_f_11} AuxVars[] AssignedVars[i1, x1]" [2025-04-26 16:54:26,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash 3021, now seen corresponding path program 1 times [2025-04-26 16:54:26,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:26,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901280798] [2025-04-26 16:54:26,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:26,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:26,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:26,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:26,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:26,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:26,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2025-04-26 16:54:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:26,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233989819] [2025-04-26 16:54:26,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:26,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:26,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:26,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:26,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:26,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 93720, now seen corresponding path program 1 times [2025-04-26 16:54:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:26,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28294123] [2025-04-26 16:54:26,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:26,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:26,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:26,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:26,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:26,823 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:26,823 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:26,824 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:26,824 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:26,824 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:26,824 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:26,824 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:26,824 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:26,824 INFO L132 ssoRankerPreferences]: Filename of dumped script: unroll-cond-4.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:26,824 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:26,824 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:26,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:26,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:26,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:26,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:26,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:26,995 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:27,003 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:27,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:27,090 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:54:27,090 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:27,095 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:27,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:54:27,159 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:27,159 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:27,160 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, i1) = 1*n - 1*i1 Supporting invariants [] [2025-04-26 16:54:27,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:27,172 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:27,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:27,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:27,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:27,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:27,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:27,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:27,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:27,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:27,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:27,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:27,252 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:54:27,254 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:27,308 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 49 states and 88 transitions. Complement of second has 5 states. [2025-04-26 16:54:27,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 16:54:27,316 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:54:27,318 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:27,318 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:27,318 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:27,318 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:27,318 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:27,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 88 transitions. [2025-04-26 16:54:27,320 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:27,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 14 states and 27 transitions. [2025-04-26 16:54:27,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 16:54:27,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-04-26 16:54:27,326 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14 states and 27 transitions. [2025-04-26 16:54:27,326 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:27,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 27 transitions. [2025-04-26 16:54:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 27 transitions. [2025-04-26 16:54:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-04-26 16:54:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (in total 24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2025-04-26 16:54:27,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 24 transitions. [2025-04-26 16:54:27,345 INFO L438 stractBuchiCegarLoop]: Abstraction has 12 states and 24 transitions. [2025-04-26 16:54:27,345 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:27,345 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 24 transitions. [2025-04-26 16:54:27,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:27,346 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:27,346 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:27,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:27,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:27,346 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L60: Formula: (and (= v_i1_5 v_x2_16) (= v_i1_5 0) (= v_i1_5 v_i2_20) (= v_i1_5 v_x1_4)) InVars {i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} OutVars{i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} AuxVars[] AssignedVars[]" "[76] L60-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] L60-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:54:27,346 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-->L33: Formula: (and (= (select v_f_39 (select v_f_39 (select v_f_39 (select v_f_39 v_x2_80)))) v_x2_79) (= (+ v_i2_84 4) v_i2_83) (< (+ 3 v_i2_84) v_n_25)) InVars {i2=v_i2_84, n=v_n_25, f=v_f_39, x2=v_x2_80} OutVars{i2=v_i2_83, n=v_n_25, f=v_f_39, x2=v_x2_79} AuxVars[] AssignedVars[x2, i2]" [2025-04-26 16:54:27,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 93730, now seen corresponding path program 1 times [2025-04-26 16:54:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:27,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461826102] [2025-04-26 16:54:27,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:27,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:27,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:27,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:27,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:27,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:27,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:27,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2025-04-26 16:54:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:27,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228171185] [2025-04-26 16:54:27,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:27,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:27,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:27,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:27,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:27,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:27,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:27,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2905702, now seen corresponding path program 1 times [2025-04-26 16:54:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:27,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564251006] [2025-04-26 16:54:27,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:27,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:27,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:27,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:27,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:27,438 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:27,438 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:27,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:27,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:27,438 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:27,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:27,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:27,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: unroll-cond-4.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:27,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:27,438 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:27,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,599 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:27,600 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:27,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:27,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,620 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:27,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:27,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,645 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,650 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 16:54:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:27,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,670 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:27,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,679 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:27,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:27,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:27,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:27,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,710 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 16:54:27,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:27,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:27,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:27,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:27,726 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:27,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,735 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:27,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:27,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:27,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:27,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:27,751 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:27,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,759 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 16:54:27,760 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 16:54:27,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:27,795 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:27,795 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:27,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,798 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 16:54:27,801 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 16:54:27,801 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:27,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:27,820 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:27,820 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:27,820 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, i2) = 1*n - 1*i2 Supporting invariants [] [2025-04-26 16:54:27,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:54:27,828 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:27,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:27,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:27,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:27,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:27,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:27,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:27,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:27,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:27,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:27,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:27,865 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:54:27,865 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 24 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:27,882 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 24 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 21 states and 38 transitions. Complement of second has 4 states. [2025-04-26 16:54:27,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-04-26 16:54:27,884 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:27,884 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:27,884 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:54:27,884 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:27,884 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:54:27,884 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:27,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 38 transitions. [2025-04-26 16:54:27,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:27,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2025-04-26 16:54:27,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:27,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:27,885 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:27,885 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:27,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:27,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:27,886 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:27,886 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:27,886 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:27,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:27,886 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:27,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:27,901 INFO L201 PluginConnector]: Adding new model unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:27 BoogieIcfgContainer [2025-04-26 16:54:27,901 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:27,902 INFO L158 Benchmark]: Toolchain (without parser) took 2049.28ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.5MB in the beginning and 63.0MB in the end (delta: 22.5MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2025-04-26 16:54:27,902 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:27,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.53ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:27,903 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:27,903 INFO L158 Benchmark]: RCFGBuilder took 303.65ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 69.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:27,903 INFO L158 Benchmark]: BuchiAutomizer took 1679.31ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 69.8MB in the beginning and 63.0MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:27,906 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.21ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.53ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 303.65ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 69.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1679.31ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 69.8MB in the beginning and 63.0MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 154ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 194, Number of transitions in reduction automaton: 33, Number of states in reduction automaton: 22, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:27,921 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...