/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/popl20/prod-cons.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:08,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:08,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:08,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:08,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:08,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:08,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:08,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:08,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:08,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:08,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:08,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:08,766 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:08,767 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:08,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:08,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:08,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:08,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:08,768 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:08,768 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:08,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:09,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:09,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:09,007 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:09,008 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:09,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl [2025-04-26 16:56:09,010 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl' [2025-04-26 16:56:09,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:09,029 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:09,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:09,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:09,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:09,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,066 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:09,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:09,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:09,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:09,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:09,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:09,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:09,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:09,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:09,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:09,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:09,119 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:56:09,121 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:56:09,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:09,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:09,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:09,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:09,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:09,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:09,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:09,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:09,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:09,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:09,144 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:56:09,181 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:09,182 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:09,275 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:09,275 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:09,290 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:09,290 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:09,291 INFO L201 PluginConnector]: Adding new model prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:09 BoogieIcfgContainer [2025-04-26 16:56:09,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:09,291 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:09,292 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:09,297 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:09,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:09,297 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/2) ... [2025-04-26 16:56:09,298 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77cbbb05 and model type prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:09, skipping insertion in model container [2025-04-26 16:56:09,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:09,298 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:09" (2/2) ... [2025-04-26 16:56:09,300 INFO L376 chiAutomizerObserver]: Analyzing ICFG prod-cons.wvr.bpl [2025-04-26 16:56:09,352 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:09,392 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:09,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:09,395 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:56:09,396 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:56:09,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 87 flow [2025-04-26 16:56:09,457 INFO L116 PetriNetUnfolderBase]: 2/27 cut-off events. [2025-04-26 16:56:09,458 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:09,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:56:09,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 87 flow [2025-04-26 16:56:09,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 27 transitions, 72 flow [2025-04-26 16:56:09,468 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 27 transitions, 72 flow [2025-04-26 16:56:09,473 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:09,615 WARN L140 AmpleReduction]: Number of pruned transitions: 121 [2025-04-26 16:56:09,615 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:09,615 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 14 [2025-04-26 16:56:09,617 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 16:56:09,617 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:72 [2025-04-26 16:56:09,617 WARN L145 AmpleReduction]: Times succ was already a loop node:17 [2025-04-26 16:56:09,617 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:18 [2025-04-26 16:56:09,617 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:09,620 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 124 states, 122 states have (on average 1.5819672131147542) internal successors, (in total 193), 123 states have internal predecessors, (193), 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:56:09,626 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:09,626 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:09,626 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:09,626 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:09,626 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:09,626 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:09,626 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:09,626 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:09,628 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 122 states have (on average 1.5819672131147542) internal successors, (in total 193), 123 states have internal predecessors, (193), 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:56:09,646 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 81 [2025-04-26 16:56:09,646 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:09,646 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:09,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:09,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:09,651 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:09,653 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 122 states have (on average 1.5819672131147542) internal successors, (in total 193), 123 states have internal predecessors, (193), 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:56:09,660 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 81 [2025-04-26 16:56:09,660 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:09,660 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:09,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:09,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:09,666 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:09,666 INFO L754 eck$LassoCheckResult]: Loop: "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" [2025-04-26 16:56:09,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1600766857, now seen corresponding path program 1 times [2025-04-26 16:56:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:09,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065535003] [2025-04-26 16:56:09,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:09,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:09,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:09,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:09,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:09,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:09,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:09,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:09,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:09,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:09,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:09,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 96387, now seen corresponding path program 1 times [2025-04-26 16:56:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:09,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495463170] [2025-04-26 16:56:09,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:09,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:09,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:09,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:09,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:09,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:09,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:09,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:09,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:09,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:09,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1423482803, now seen corresponding path program 1 times [2025-04-26 16:56:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:09,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586332321] [2025-04-26 16:56:09,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:09,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:09,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:09,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:09,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:09,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:09,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:09,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:09,934 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:09,935 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:09,935 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:09,935 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:09,935 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:09,935 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:09,936 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:09,936 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:09,936 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:09,936 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:09,936 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:09,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:09,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:09,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:09,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,116 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:10,119 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:10,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,122 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:56:10,124 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:56:10,126 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:56:10,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,180 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:10,197 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:56:10,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,203 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:56:10,208 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:56:10,209 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:56:10,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:10,250 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:10,250 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:10,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,254 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:56:10,255 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:56:10,256 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:10,272 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 16:56:10,273 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:10,273 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:10,273 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2025-04-26 16:56:10,279 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:56:10,282 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:10,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:10,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:10,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:10,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:10,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:10,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:10,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:10,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:10,368 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:56:10,388 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 16:56:10,390 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 124 states, 122 states have (on average 1.5819672131147542) internal successors, (in total 193), 123 states have internal predecessors, (193), 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 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:10,474 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 124 states, 122 states have (on average 1.5819672131147542) internal successors, (in total 193), 123 states have internal predecessors, (193), 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 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 298 states and 545 transitions. Complement of second has 7 states. [2025-04-26 16:56:10,475 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 16:56:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2025-04-26 16:56:10,485 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:10,486 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:10,486 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:56:10,486 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:10,487 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:56:10,487 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:10,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 545 transitions. [2025-04-26 16:56:10,500 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:10,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 122 states and 232 transitions. [2025-04-26 16:56:10,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-04-26 16:56:10,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-04-26 16:56:10,507 INFO L74 IsDeterministic]: Start isDeterministic. Operand 122 states and 232 transitions. [2025-04-26 16:56:10,507 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:10,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 232 transitions. [2025-04-26 16:56:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 232 transitions. [2025-04-26 16:56:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2025-04-26 16:56:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.93) internal successors, (in total 193), 99 states have internal predecessors, (193), 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:56:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 193 transitions. [2025-04-26 16:56:10,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 193 transitions. [2025-04-26 16:56:10,533 INFO L438 stractBuchiCegarLoop]: Abstraction has 100 states and 193 transitions. [2025-04-26 16:56:10,533 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:10,533 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 193 transitions. [2025-04-26 16:56:10,536 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:10,536 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,536 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:10,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,539 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L57-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:56:10,539 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" [2025-04-26 16:56:10,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1915835068, now seen corresponding path program 1 times [2025-04-26 16:56:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118760281] [2025-04-26 16:56:10,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:10,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:10,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:10,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:10,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 1 times [2025-04-26 16:56:10,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739547166] [2025-04-26 16:56:10,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1177814195, now seen corresponding path program 1 times [2025-04-26 16:56:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495459518] [2025-04-26 16:56:10,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:10,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:10,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:10,597 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:56:10,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:10,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495459518] [2025-04-26 16:56:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495459518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829120271] [2025-04-26 16:56:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:10,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:10,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:10,637 INFO L87 Difference]: Start difference. First operand 100 states and 193 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:56:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:10,656 INFO L93 Difference]: Finished difference Result 141 states and 246 transitions. [2025-04-26 16:56:10,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 246 transitions. [2025-04-26 16:56:10,658 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:10,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 115 states and 214 transitions. [2025-04-26 16:56:10,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-04-26 16:56:10,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-04-26 16:56:10,659 INFO L74 IsDeterministic]: Start isDeterministic. Operand 115 states and 214 transitions. [2025-04-26 16:56:10,659 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:10,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 214 transitions. [2025-04-26 16:56:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 214 transitions. [2025-04-26 16:56:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-04-26 16:56:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.9326923076923077) internal successors, (in total 201), 103 states have internal predecessors, (201), 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:56:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 201 transitions. [2025-04-26 16:56:10,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 201 transitions. [2025-04-26 16:56:10,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:10,668 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 201 transitions. [2025-04-26 16:56:10,668 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:10,668 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 201 transitions. [2025-04-26 16:56:10,669 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:10,669 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,669 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:10,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,669 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[83] L57-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:56:10,669 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" [2025-04-26 16:56:10,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1178293850, now seen corresponding path program 1 times [2025-04-26 16:56:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966733194] [2025-04-26 16:56:10,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:10,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:10,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:10,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:10,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 2 times [2025-04-26 16:56:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904388605] [2025-04-26 16:56:10,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:10,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:10,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 215696419, now seen corresponding path program 1 times [2025-04-26 16:56:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039811615] [2025-04-26 16:56:10,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:10,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:10,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:10,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:10,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,852 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:10,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:10,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:10,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:10,853 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:10,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:10,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:10,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:10,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:10,853 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:10,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,980 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:10,980 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:10,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,982 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:56:10,984 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:56:10,985 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:56:10,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,999 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:11,005 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:56:11,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,007 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:56:11,008 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:56:11,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:11,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,027 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:11,033 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:56:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,035 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:56:11,037 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:56:11,038 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:56:11,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:11,066 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:11,066 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:11,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,068 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:56:11,070 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:56:11,072 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:11,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:11,089 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:11,089 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:11,090 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2025-04-26 16:56:11,095 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:56:11,096 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:11,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:11,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:11,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,172 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:56:11,172 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 16:56:11,173 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 201 transitions. cyclomatic complexity: 112 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,199 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 201 transitions. cyclomatic complexity: 112. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 261 states and 471 transitions. Complement of second has 5 states. [2025-04-26 16:56:11,199 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:56:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-26 16:56:11,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:56:11,200 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:56:11,200 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:56:11,201 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 471 transitions. [2025-04-26 16:56:11,204 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:11,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 130 states and 250 transitions. [2025-04-26 16:56:11,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:56:11,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:56:11,205 INFO L74 IsDeterministic]: Start isDeterministic. Operand 130 states and 250 transitions. [2025-04-26 16:56:11,205 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 250 transitions. [2025-04-26 16:56:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 250 transitions. [2025-04-26 16:56:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2025-04-26 16:56:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.990990990990991) internal successors, (in total 221), 110 states have internal predecessors, (221), 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:56:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 221 transitions. [2025-04-26 16:56:11,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 221 transitions. [2025-04-26 16:56:11,213 INFO L438 stractBuchiCegarLoop]: Abstraction has 111 states and 221 transitions. [2025-04-26 16:56:11,214 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:11,214 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 221 transitions. [2025-04-26 16:56:11,215 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:11,215 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,215 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,216 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:11,216 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L57-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]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[86] L58-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:11,216 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" [2025-04-26 16:56:11,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2142311790, now seen corresponding path program 1 times [2025-04-26 16:56:11,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209767924] [2025-04-26 16:56:11,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:11,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:11,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:11,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:11,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,233 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 3 times [2025-04-26 16:56:11,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823687064] [2025-04-26 16:56:11,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:11,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1603411109, now seen corresponding path program 1 times [2025-04-26 16:56:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877231314] [2025-04-26 16:56:11,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:11,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:11,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,414 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:11,414 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:11,414 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:11,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:11,414 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:11,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:11,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:11,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:56:11,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:11,414 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:11,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,562 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:11,562 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:11,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,565 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:56:11,566 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:56:11,567 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:56:11,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,585 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:11,594 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:56:11,594 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:56:11,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,597 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:56:11,599 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:56:11,600 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:11,615 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:56:11,615 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:11,616 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:11,616 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2025-04-26 16:56:11,621 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:56:11,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:11,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:11,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:11,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,676 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:56:11,677 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 16:56:11,677 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 221 transitions. cyclomatic complexity: 127 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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:56:11,697 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 221 transitions. cyclomatic complexity: 127. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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 240 states and 451 transitions. Complement of second has 5 states. [2025-04-26 16:56:11,698 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:56:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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:56:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-26 16:56:11,698 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:56:11,699 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,699 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:56:11,699 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,699 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 16:56:11,699 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 240 states and 451 transitions. [2025-04-26 16:56:11,701 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:11,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 240 states to 134 states and 254 transitions. [2025-04-26 16:56:11,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:56:11,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:56:11,702 INFO L74 IsDeterministic]: Start isDeterministic. Operand 134 states and 254 transitions. [2025-04-26 16:56:11,702 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,702 INFO L218 hiAutomatonCegarLoop]: Abstraction has 134 states and 254 transitions. [2025-04-26 16:56:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 254 transitions. [2025-04-26 16:56:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2025-04-26 16:56:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.9469026548672566) internal successors, (in total 220), 112 states have internal predecessors, (220), 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:56:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 220 transitions. [2025-04-26 16:56:11,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 220 transitions. [2025-04-26 16:56:11,708 INFO L438 stractBuchiCegarLoop]: Abstraction has 113 states and 220 transitions. [2025-04-26 16:56:11,708 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:11,708 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 220 transitions. [2025-04-26 16:56:11,709 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:11,709 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,709 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:11,710 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L57-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]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:11,710 INFO L754 eck$LassoCheckResult]: Loop: "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:11,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2142311776, now seen corresponding path program 1 times [2025-04-26 16:56:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526495845] [2025-04-26 16:56:11,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:11,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:11,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:11,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:11,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 103302, now seen corresponding path program 4 times [2025-04-26 16:56:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667007858] [2025-04-26 16:56:11,719 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 16:56:11,728 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:11,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1603826233, now seen corresponding path program 2 times [2025-04-26 16:56:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805628448] [2025-04-26 16:56:11,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:56:11,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:11,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,847 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:11,847 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:11,847 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:11,847 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:11,847 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:11,847 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,847 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:11,847 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:11,847 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:11,847 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:11,847 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:11,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,960 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:11,960 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:11,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,962 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:56:11,964 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:56:11,965 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:56:11,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,980 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:11,985 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 16:56:11,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,987 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 16:56:11,987 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 16:56:11,988 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:56:11,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,003 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,011 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 16:56:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,016 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 16:56:12,017 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 16:56:12,019 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:56:12,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:12,041 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:12,041 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:12,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,043 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 16:56:12,043 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 16:56:12,044 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:12,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:12,060 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:12,060 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:12,060 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2025-04-26 16:56:12,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:12,066 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:12,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:12,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,130 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:56:12,130 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 16:56:12,131 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 220 transitions. cyclomatic complexity: 124 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:56:12,147 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 220 transitions. cyclomatic complexity: 124. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 330 states and 598 transitions. Complement of second has 5 states. [2025-04-26 16:56:12,148 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:56:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:56:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 16:56:12,149 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:56:12,149 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,149 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:56:12,149 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,149 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 16:56:12,149 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330 states and 598 transitions. [2025-04-26 16:56:12,156 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:12,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330 states to 180 states and 342 transitions. [2025-04-26 16:56:12,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:56:12,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:56:12,158 INFO L74 IsDeterministic]: Start isDeterministic. Operand 180 states and 342 transitions. [2025-04-26 16:56:12,158 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:12,158 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 342 transitions. [2025-04-26 16:56:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 342 transitions. [2025-04-26 16:56:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2025-04-26 16:56:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.9328358208955223) internal successors, (in total 259), 133 states have internal predecessors, (259), 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:56:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 259 transitions. [2025-04-26 16:56:12,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 259 transitions. [2025-04-26 16:56:12,163 INFO L438 stractBuchiCegarLoop]: Abstraction has 134 states and 259 transitions. [2025-04-26 16:56:12,164 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:12,164 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 259 transitions. [2025-04-26 16:56:12,164 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:12,164 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,164 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,164 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:12,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:12,165 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L57-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]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" [2025-04-26 16:56:12,165 INFO L754 eck$LassoCheckResult]: Loop: "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" [2025-04-26 16:56:12,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1991712690, now seen corresponding path program 1 times [2025-04-26 16:56:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898099625] [2025-04-26 16:56:12,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:12,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:12,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:12,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:12,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash 104172, now seen corresponding path program 5 times [2025-04-26 16:56:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384197872] [2025-04-26 16:56:12,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:56:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,190 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,191 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,191 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:12,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash 139627931, now seen corresponding path program 3 times [2025-04-26 16:56:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536624341] [2025-04-26 16:56:12,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 3 equivalence classes. [2025-04-26 16:56:12,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:12,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:56:12,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:12,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536624341] [2025-04-26 16:56:12,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536624341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:56:12,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288178750] [2025-04-26 16:56:12,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:12,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:56:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,255 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-26 16:56:12,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 3 equivalence classes. [2025-04-26 16:56:12,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:12,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:56:12,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:56:12,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:56:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:56:12,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288178750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:56:12,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:56:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-04-26 16:56:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142149613] [2025-04-26 16:56:12,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:56:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:12,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:56:12,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:56:12,355 INFO L87 Difference]: Start difference. First operand 134 states and 259 transitions. cyclomatic complexity: 146 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (in total 20), 5 states have internal predecessors, (20), 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:56:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:12,383 INFO L93 Difference]: Finished difference Result 337 states and 612 transitions. [2025-04-26 16:56:12,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 612 transitions. [2025-04-26 16:56:12,385 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:12,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 251 states and 474 transitions. [2025-04-26 16:56:12,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:56:12,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:56:12,387 INFO L74 IsDeterministic]: Start isDeterministic. Operand 251 states and 474 transitions. [2025-04-26 16:56:12,387 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:12,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 251 states and 474 transitions. [2025-04-26 16:56:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 474 transitions. [2025-04-26 16:56:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 202. [2025-04-26 16:56:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.9108910891089108) internal successors, (in total 386), 201 states have internal predecessors, (386), 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:56:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 386 transitions. [2025-04-26 16:56:12,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 386 transitions. [2025-04-26 16:56:12,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:12,394 INFO L438 stractBuchiCegarLoop]: Abstraction has 202 states and 386 transitions. [2025-04-26 16:56:12,394 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:56:12,394 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 386 transitions. [2025-04-26 16:56:12,396 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:12,396 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,396 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:12,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:12,396 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L57-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]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" [2025-04-26 16:56:12,397 INFO L754 eck$LassoCheckResult]: Loop: "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" [2025-04-26 16:56:12,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1820780038, now seen corresponding path program 2 times [2025-04-26 16:56:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715208890] [2025-04-26 16:56:12,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:12,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-26 16:56:12,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:12,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:12,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:12,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:12,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 104172, now seen corresponding path program 6 times [2025-04-26 16:56:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581256022] [2025-04-26 16:56:12,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:56:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,409 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,410 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,410 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:56:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1716205255, now seen corresponding path program 4 times [2025-04-26 16:56:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942618229] [2025-04-26 16:56:12,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:12,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,425 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-26 16:56:12,429 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:12,429 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:12,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:12,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:12,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,572 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:12,572 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:12,572 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:12,572 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:12,572 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:12,572 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,572 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:12,572 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:12,572 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:56:12,572 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:12,572 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:12,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,717 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:12,717 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:12,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,720 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 16:56:12,721 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 16:56:12,722 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:56:12,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,735 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,741 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 16:56:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,744 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 16:56:12,745 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 16:56:12,746 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:56:12,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,762 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,768 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 16:56:12,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,771 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:56:12,773 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:56:12,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,792 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:12,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,799 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:12,801 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:56:12,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:12,829 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:12,829 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:12,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,833 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:12,835 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:12,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:56:12,851 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:12,851 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:12,851 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2025-04-26 16:56:12,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:12,861 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:12,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,893 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:56:12,893 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:56:12,894 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 202 states and 386 transitions. cyclomatic complexity: 207 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:56:12,917 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 202 states and 386 transitions. cyclomatic complexity: 207. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 458 states and 818 transitions. Complement of second has 5 states. [2025-04-26 16:56:12,918 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:56:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:56:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-26 16:56:12,919 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 16:56:12,919 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,919 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:56:12,919 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,919 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 16:56:12,919 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 458 states and 818 transitions. [2025-04-26 16:56:12,924 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:12,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 458 states to 300 states and 551 transitions. [2025-04-26 16:56:12,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:56:12,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:56:12,927 INFO L74 IsDeterministic]: Start isDeterministic. Operand 300 states and 551 transitions. [2025-04-26 16:56:12,927 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:12,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 300 states and 551 transitions. [2025-04-26 16:56:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states and 551 transitions. [2025-04-26 16:56:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 230. [2025-04-26 16:56:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.8782608695652174) internal successors, (in total 432), 229 states have internal predecessors, (432), 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:56:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 432 transitions. [2025-04-26 16:56:12,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 230 states and 432 transitions. [2025-04-26 16:56:12,939 INFO L438 stractBuchiCegarLoop]: Abstraction has 230 states and 432 transitions. [2025-04-26 16:56:12,939 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:56:12,939 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 432 transitions. [2025-04-26 16:56:12,941 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:12,942 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,942 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:12,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:12,942 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[83] L57-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]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" [2025-04-26 16:56:12,942 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" [2025-04-26 16:56:12,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1523950043, now seen corresponding path program 5 times [2025-04-26 16:56:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463296287] [2025-04-26 16:56:12,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:56:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,945 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-26 16:56:12,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:12,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-26 16:56:12,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:12,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:12,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 7 times [2025-04-26 16:56:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314550892] [2025-04-26 16:56:12,952 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:56:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2103626564, now seen corresponding path program 6 times [2025-04-26 16:56:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867359053] [2025-04-26 16:56:12,956 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:56:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,958 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-26 16:56:12,962 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:56:12,962 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-26 16:56:12,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:56:12,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:56:12,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,123 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:13,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:13,123 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:13,123 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:13,123 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:13,123 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:13,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:13,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:56:13,123 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:13,123 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:13,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,299 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:13,300 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:13,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,301 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:56:13,303 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:56:13,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,317 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:56:13,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,324 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:56:13,326 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:56:13,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,345 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:13,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,353 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:56:13,355 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:56:13,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,368 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:56:13,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,404 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:56:13,406 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:56:13,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,426 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:13,433 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:13,433 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:56:13,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,435 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:56:13,437 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:13,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:13,454 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:13,454 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:13,454 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2025-04-26 16:56:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:56:13,461 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:13,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:13,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:13,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:13,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:13,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,507 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:56:13,508 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 16:56:13,508 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 230 states and 432 transitions. cyclomatic complexity: 229 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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:56:13,528 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 230 states and 432 transitions. cyclomatic complexity: 229. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 526 states and 976 transitions. Complement of second has 5 states. [2025-04-26 16:56:13,528 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:56:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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:56:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:56:13,529 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 19 letters. Loop has 3 letters. [2025-04-26 16:56:13,529 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,529 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 22 letters. Loop has 3 letters. [2025-04-26 16:56:13,529 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,529 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 19 letters. Loop has 6 letters. [2025-04-26 16:56:13,530 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 526 states and 976 transitions. [2025-04-26 16:56:13,533 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:13,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 526 states to 347 states and 654 transitions. [2025-04-26 16:56:13,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:56:13,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:56:13,535 INFO L74 IsDeterministic]: Start isDeterministic. Operand 347 states and 654 transitions. [2025-04-26 16:56:13,536 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:13,536 INFO L218 hiAutomatonCegarLoop]: Abstraction has 347 states and 654 transitions. [2025-04-26 16:56:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 654 transitions. [2025-04-26 16:56:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 256. [2025-04-26 16:56:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 256 states have (on average 1.9296875) internal successors, (in total 494), 255 states have internal predecessors, (494), 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:56:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 494 transitions. [2025-04-26 16:56:13,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 256 states and 494 transitions. [2025-04-26 16:56:13,546 INFO L438 stractBuchiCegarLoop]: Abstraction has 256 states and 494 transitions. [2025-04-26 16:56:13,546 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:56:13,546 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 494 transitions. [2025-04-26 16:56:13,547 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:13,547 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:13,547 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:13,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:13,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:13,549 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L57-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]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,550 INFO L754 eck$LassoCheckResult]: Loop: "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 891133169, now seen corresponding path program 7 times [2025-04-26 16:56:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862474196] [2025-04-26 16:56:13,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:56:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:13,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:13,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:13,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:13,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 103302, now seen corresponding path program 8 times [2025-04-26 16:56:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734209657] [2025-04-26 16:56:13,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:13,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:13,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:13,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:13,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:13,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:13,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 555454614, now seen corresponding path program 8 times [2025-04-26 16:56:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125382695] [2025-04-26 16:56:13,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:13,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-26 16:56:13,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:13,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:13,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:13,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:13,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,715 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:13,715 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:13,715 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:13,715 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:13,715 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:13,715 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,715 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:13,715 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:13,715 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:56:13,715 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:13,715 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:13,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,861 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:13,861 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:13,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,863 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:56:13,865 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:56:13,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,878 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:56:13,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,885 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:56:13,889 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:56:13,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,907 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:13,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,917 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:56:13,919 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:56:13,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,936 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:13,945 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:13,945 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:13,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,947 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:56:13,948 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:13,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:56:13,964 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:13,964 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:13,964 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2025-04-26 16:56:13,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:56:13,979 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:13,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:13,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:14,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:14,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,029 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:56:14,030 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 16:56:14,030 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 256 states and 494 transitions. cyclomatic complexity: 269 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,041 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 256 states and 494 transitions. cyclomatic complexity: 269. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 391 states and 726 transitions. Complement of second has 5 states. [2025-04-26 16:56:14,042 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:56:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-04-26 16:56:14,042 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 20 letters. Loop has 3 letters. [2025-04-26 16:56:14,044 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,044 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:14,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:14,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:14,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,100 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:56:14,100 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:14,100 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 256 states and 494 transitions. cyclomatic complexity: 269 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,131 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 256 states and 494 transitions. cyclomatic complexity: 269. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 763 states and 1439 transitions. Complement of second has 7 states. [2025-04-26 16:56:14,132 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 16:56:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-26 16:56:14,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 20 letters. Loop has 3 letters. [2025-04-26 16:56:14,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 16:56:14,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 20 letters. Loop has 6 letters. [2025-04-26 16:56:14,134 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 763 states and 1439 transitions. [2025-04-26 16:56:14,138 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:14,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 763 states to 506 states and 956 transitions. [2025-04-26 16:56:14,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:56:14,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:56:14,142 INFO L74 IsDeterministic]: Start isDeterministic. Operand 506 states and 956 transitions. [2025-04-26 16:56:14,142 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:14,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 506 states and 956 transitions. [2025-04-26 16:56:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 956 transitions. [2025-04-26 16:56:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 358. [2025-04-26 16:56:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 358 states have (on average 1.9804469273743017) internal successors, (in total 709), 357 states have internal predecessors, (709), 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:56:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 709 transitions. [2025-04-26 16:56:14,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 358 states and 709 transitions. [2025-04-26 16:56:14,152 INFO L438 stractBuchiCegarLoop]: Abstraction has 358 states and 709 transitions. [2025-04-26 16:56:14,152 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:56:14,152 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 358 states and 709 transitions. [2025-04-26 16:56:14,154 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:14,154 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:14,154 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:14,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:14,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:14,155 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L53: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[64] L53-->L54: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[39] L54-->L55: Formula: (= v_d_3 0) InVars {d=v_d_3} OutVars{d=v_d_3} AuxVars[] AssignedVars[]" "[52] L55-->L56: Formula: v_v_assert_5 InVars {v_assert=v_v_assert_5} OutVars{v_assert=v_v_assert_5} AuxVars[] AssignedVars[]" "[42] L56-->L57: Formula: (= v_front_5 v_back_5) InVars {front=v_front_5, back=v_back_5} OutVars{front=v_front_5, back=v_back_5} AuxVars[] AssignedVars[]" "[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[83] L57-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]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" "[67] L21-->L22: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L22-->L22-1: Formula: (and (= (select v_queue_3 v_back_7) 1) (= v_back_6 (+ v_back_7 1))) InVars {queue=v_queue_3, back=v_back_7} OutVars{queue=v_queue_3, back=v_back_6} AuxVars[] AssignedVars[back]" "[70] L22-1-->L21: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:14,155 INFO L754 eck$LassoCheckResult]: Loop: "[74] L34-->L34-1: Formula: (and (= v_front_10 (+ v_front_11 1)) (= v_temp_5 (select v_queue_7 v_front_11)) (< v_front_11 v_back_10)) InVars {front=v_front_11, queue=v_queue_7, back=v_back_10} OutVars{front=v_front_10, back=v_back_10, queue=v_queue_7, temp=v_temp_5} AuxVars[] AssignedVars[front, temp]" "[75] L34-1-->L33: Formula: (= (+ v_d_2 v_temp_2) v_d_1) InVars {d=v_d_2, temp=v_temp_2} OutVars{d=v_d_1, temp=v_temp_2} AuxVars[] AssignedVars[d]" "[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:14,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1456373095, now seen corresponding path program 9 times [2025-04-26 16:56:14,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691433195] [2025-04-26 16:56:14,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:14,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-26 16:56:14,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:56:14,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:14,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 103302, now seen corresponding path program 9 times [2025-04-26 16:56:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834150437] [2025-04-26 16:56:14,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:14,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:14,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:14,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,165 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:14,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:14,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash -948677536, now seen corresponding path program 10 times [2025-04-26 16:56:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516328771] [2025-04-26 16:56:14,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,168 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-26 16:56:14,172 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:14,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:14,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:14,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:14,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,300 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:14,300 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:14,300 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:14,300 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:14,300 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:14,300 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,300 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:14,300 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:14,300 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:56:14,300 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:14,300 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:14,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,468 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:14,468 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,470 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:56:14,472 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:56:14,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,485 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:56:14,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,492 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:56:14,494 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:56:14,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,508 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,515 INFO L229 MonitoredProcess]: Starting monitored process 33 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:56:14,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:56:14,517 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:56:14,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:56:14,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,538 INFO L229 MonitoredProcess]: Starting monitored process 34 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:56:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:56:14,539 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:56:14,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,556 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:56:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,596 INFO L229 MonitoredProcess]: Starting monitored process 35 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:56:14,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:56:14,597 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:56:14,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,613 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:14,619 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:14,619 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:14,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,621 INFO L229 MonitoredProcess]: Starting monitored process 36 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:56:14,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:56:14,622 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:14,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:56:14,638 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:14,638 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:14,638 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2025-04-26 16:56:14,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:56:14,645 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:14,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:14,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:14,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:14,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,699 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:56:14,700 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 16:56:14,700 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 358 states and 709 transitions. cyclomatic complexity: 390 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,710 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 358 states and 709 transitions. cyclomatic complexity: 390. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 502 states and 947 transitions. Complement of second has 5 states. [2025-04-26 16:56:14,710 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:56:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-04-26 16:56:14,711 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 20 letters. Loop has 3 letters. [2025-04-26 16:56:14,711 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,711 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:14,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:14,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:14,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,775 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:56:14,776 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:14,776 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 358 states and 709 transitions. cyclomatic complexity: 390 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,801 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 358 states and 709 transitions. cyclomatic complexity: 390. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 578 states and 1092 transitions. Complement of second has 7 states. [2025-04-26 16:56:14,802 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 16:56:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 16:56:14,804 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 20 letters. Loop has 3 letters. [2025-04-26 16:56:14,804 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,804 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:14,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:14,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:14,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:14,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,863 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:56:14,863 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:14,863 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 358 states and 709 transitions. cyclomatic complexity: 390 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,880 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 358 states and 709 transitions. cyclomatic complexity: 390. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 687 states and 1297 transitions. Complement of second has 6 states. [2025-04-26 16:56:14,880 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:56:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-26 16:56:14,881 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 20 letters. Loop has 3 letters. [2025-04-26 16:56:14,881 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,881 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 16:56:14,881 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,881 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 20 letters. Loop has 6 letters. [2025-04-26 16:56:14,881 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 1297 transitions. [2025-04-26 16:56:14,884 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:14,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 0 states and 0 transitions. [2025-04-26 16:56:14,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:14,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:14,885 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:14,885 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:14,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:14,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:14,885 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:14,885 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:56:14,885 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:14,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:14,885 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:14,895 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 16:56:14,896 INFO L201 PluginConnector]: Adding new model prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:14 BoogieIcfgContainer [2025-04-26 16:56:14,896 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:14,897 INFO L158 Benchmark]: Toolchain (without parser) took 5867.76ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.7MB in the beginning and 103.4MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:14,897 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.87ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 86.5MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:14,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.33ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:14,897 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:14,897 INFO L158 Benchmark]: RCFGBuilder took 198.79ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 72.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:14,898 INFO L158 Benchmark]: BuchiAutomizer took 5604.66ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.2MB in the beginning and 103.4MB in the end (delta: -31.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:14,899 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.87ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 86.5MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.33ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 198.79ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 72.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5604.66ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.2MB in the beginning and 103.4MB in the end (delta: -31.2MB). 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 5.4s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 477 StatesRemovedByMinimization, 9 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 [6, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 377 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 233 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp65 ukn94 mio100 lsp59 div100 bol100 ite100 ukn100 eq208 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 229, Number of transitions in reduction automaton: 193, Number of states in reduction automaton: 124, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function w and consists of 5 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 4 locations. One nondeterministic module has affine ranking function back + -1 * front and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:14,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-26 16:56:15,112 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...