/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-more/buffer-mult.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:26,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:26,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:26,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:26,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:26,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:26,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:26,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:26,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:26,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:26,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:26,480 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:26,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:26,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:26,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:26,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:26,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:26,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:26,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:26,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:26,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:26,482 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:26,482 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:26,482 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:26,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:26,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:26,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:26,711 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:26,712 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:26,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl [2025-04-26 16:55:26,714 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl' [2025-04-26 16:55:26,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:26,728 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:26,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:26,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:26,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:26,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,757 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:26,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:26,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:26,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:26,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:26,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:26,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:26,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:26,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:26,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/1) ... [2025-04-26 16:55:26,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:26,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,807 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:55:26,809 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:55:26,827 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:26,828 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:26,828 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:26,828 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:26,828 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:55:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:55:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:55:26,829 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:55:26,870 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:26,871 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:26,967 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:26,967 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:26,990 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:26,990 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:26,991 INFO L201 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:26 BoogieIcfgContainer [2025-04-26 16:55:26,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:26,991 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:26,991 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:26,996 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:26,996 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:26,997 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:26" (1/2) ... [2025-04-26 16:55:26,997 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@600b9807 and model type buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:26, skipping insertion in model container [2025-04-26 16:55:26,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:26,998 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:26" (2/2) ... [2025-04-26 16:55:26,999 INFO L376 chiAutomizerObserver]: Analyzing ICFG buffer-mult.wvr.bpl [2025-04-26 16:55:27,046 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:55:27,073 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:27,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:27,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,076 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:55:27,077 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:55:27,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:27,137 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 16:55:27,138 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:55:27,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:55:27,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:27,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:27,143 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:27,151 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:27,374 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 511#[L25, thread2EXIT, L75, L49-1]true [2025-04-26 16:55:27,455 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1247#[L61, L49-1, L37-1, L76, L25]true [2025-04-26 16:55:27,455 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1235#[L61, L37, L49-1, L76, L25-1]true [2025-04-26 16:55:27,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 689#[L49-1, L37-1, L75, L25-1]true [2025-04-26 16:55:27,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 683#[L25, L75, L37, L49-1]true [2025-04-26 16:55:27,457 WARN L140 AmpleReduction]: Number of pruned transitions: 949 [2025-04-26 16:55:27,457 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 16:55:27,457 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 168 [2025-04-26 16:55:27,457 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:47 [2025-04-26 16:55:27,458 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:382 [2025-04-26 16:55:27,458 WARN L145 AmpleReduction]: Times succ was already a loop node:233 [2025-04-26 16:55:27,458 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:219 [2025-04-26 16:55:27,458 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:27,464 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 593 states, 591 states have (on average 2.186125211505922) internal successors, (in total 1292), 592 states have internal predecessors, (1292), 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:55:27,470 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:27,471 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:27,471 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:27,471 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:27,471 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:27,471 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:27,471 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:27,471 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:27,474 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 593 states, 591 states have (on average 2.186125211505922) internal successors, (in total 1292), 592 states have internal predecessors, (1292), 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:55:27,506 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 490 [2025-04-26 16:55:27,507 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:27,507 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:27,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:27,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:27,514 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:27,515 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 593 states, 591 states have (on average 2.186125211505922) internal successors, (in total 1292), 592 states have internal predecessors, (1292), 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:55:27,526 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 490 [2025-04-26 16:55:27,526 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:27,526 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:27,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:27,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:27,532 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:27,532 INFO L754 eck$LassoCheckResult]: Loop: "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_3) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_3} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_3} AuxVars[] AssignedVars[q1_back]" "[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" [2025-04-26 16:55:27,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 3578, now seen corresponding path program 1 times [2025-04-26 16:55:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:27,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740068154] [2025-04-26 16:55:27,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:27,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:27,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:27,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:27,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:27,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:27,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:27,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash 116247, now seen corresponding path program 1 times [2025-04-26 16:55:27,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:27,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482125215] [2025-04-26 16:55:27,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:27,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:27,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:27,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:27,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:27,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:27,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:27,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:27,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash 106678654, now seen corresponding path program 1 times [2025-04-26 16:55:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:27,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786543532] [2025-04-26 16:55:27,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:27,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:27,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:27,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:27,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:27,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:27,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:27,720 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:27,720 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:27,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:27,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:27,721 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:27,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:27,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:27,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:27,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:27,721 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:27,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,902 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:27,905 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:27,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,908 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:55:27,910 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:55:27,911 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:55:27,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,940 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,948 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:55:27,949 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:55:27,950 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:55:27,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:27,975 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:55:27,976 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:27,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,979 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:55:27,980 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:55:27,981 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:27,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:27,999 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:27,999 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:27,999 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:55:28,005 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:55:28,007 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:28,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:28,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:28,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:28,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:28,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:28,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:28,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:28,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:28,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:28,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:28,070 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:55:28,083 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:55:28,086 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 593 states, 591 states have (on average 2.186125211505922) internal successors, (in total 1292), 592 states have internal predecessors, (1292), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:28,220 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 593 states, 591 states have (on average 2.186125211505922) internal successors, (in total 1292), 592 states have internal predecessors, (1292), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1611 states and 3474 transitions. Complement of second has 7 states. [2025-04-26 16:55:28,221 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:55:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-04-26 16:55:28,228 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:55:28,229 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:28,229 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:55:28,229 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:28,229 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:55:28,229 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:28,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1611 states and 3474 transitions. [2025-04-26 16:55:28,250 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 305 [2025-04-26 16:55:28,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1611 states to 796 states and 1726 transitions. [2025-04-26 16:55:28,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2025-04-26 16:55:28,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 501 [2025-04-26 16:55:28,269 INFO L74 IsDeterministic]: Start isDeterministic. Operand 796 states and 1726 transitions. [2025-04-26 16:55:28,269 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:28,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 796 states and 1726 transitions. [2025-04-26 16:55:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 1726 transitions. [2025-04-26 16:55:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 706. [2025-04-26 16:55:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 706 states have (on average 2.1728045325779037) internal successors, (in total 1534), 705 states have internal predecessors, (1534), 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:55:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1534 transitions. [2025-04-26 16:55:28,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 1534 transitions. [2025-04-26 16:55:28,325 INFO L438 stractBuchiCegarLoop]: Abstraction has 706 states and 1534 transitions. [2025-04-26 16:55:28,325 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:28,325 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 1534 transitions. [2025-04-26 16:55:28,328 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 305 [2025-04-26 16:55:28,328 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:28,328 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:28,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:28,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:28,329 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L36: 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:55:28,329 INFO L754 eck$LassoCheckResult]: Loop: "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L37-->L37-1: Formula: (and (= (+ v_C_5 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" "[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 16:55:28,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash 3441264, now seen corresponding path program 1 times [2025-04-26 16:55:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:28,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138595161] [2025-04-26 16:55:28,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:28,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:28,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:28,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:28,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:28,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:28,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:28,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 16:55:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:28,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875574800] [2025-04-26 16:55:28,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:28,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:28,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:28,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:28,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:28,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:28,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:28,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash -560427859, now seen corresponding path program 1 times [2025-04-26 16:55:28,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:28,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479274404] [2025-04-26 16:55:28,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:28,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:28,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:28,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:28,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:28,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:28,453 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:28,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:28,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:28,454 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:28,454 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:28,454 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:28,454 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:28,454 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:28,454 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:55:28,454 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:28,454 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:28,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:28,569 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:28,569 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:28,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:28,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:28,575 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:55:28,576 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:55:28,578 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:55:28,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:28,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:28,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:28,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:28,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:28,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:28,596 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:28,602 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:55:28,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:28,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:28,604 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:55:28,604 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:55:28,606 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:55:28,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:28,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:28,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:28,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:28,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:28,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:28,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:28,630 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:55:28,630 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:28,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:28,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:28,633 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:55:28,634 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:55:28,635 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:28,651 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:55:28,652 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:28,652 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:28,652 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, j) = 1*N - 1*j Supporting invariants [] [2025-04-26 16:55:28,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:28,658 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:28,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:28,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:28,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:28,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:28,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:28,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:28,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:28,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:28,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:28,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:28,708 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:55:28,708 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:55:28,708 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 706 states and 1534 transitions. cyclomatic complexity: 939 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:55:28,775 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 706 states and 1534 transitions. cyclomatic complexity: 939. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 1855 states and 3971 transitions. Complement of second has 7 states. [2025-04-26 16:55:28,776 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:55:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:55:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-26 16:55:28,777 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:55:28,777 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:28,777 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:55:28,777 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:28,777 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:55:28,777 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:28,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1855 states and 3971 transitions. [2025-04-26 16:55:28,802 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 182 [2025-04-26 16:55:28,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1855 states to 1037 states and 2238 transitions. [2025-04-26 16:55:28,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2025-04-26 16:55:28,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2025-04-26 16:55:28,810 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1037 states and 2238 transitions. [2025-04-26 16:55:28,810 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:28,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1037 states and 2238 transitions. [2025-04-26 16:55:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states and 2238 transitions. [2025-04-26 16:55:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 967. [2025-04-26 16:55:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 967 states have (on average 2.1882109617373318) internal successors, (in total 2116), 966 states have internal predecessors, (2116), 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:55:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2116 transitions. [2025-04-26 16:55:28,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 967 states and 2116 transitions. [2025-04-26 16:55:28,834 INFO L438 stractBuchiCegarLoop]: Abstraction has 967 states and 2116 transitions. [2025-04-26 16:55:28,835 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:28,835 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 967 states and 2116 transitions. [2025-04-26 16:55:28,838 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 182 [2025-04-26 16:55:28,838 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:28,838 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:28,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:28,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:28,839 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L36: 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]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: 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:55:28,839 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:28,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash -987909628, now seen corresponding path program 1 times [2025-04-26 16:55:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:28,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801075674] [2025-04-26 16:55:28,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:28,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:28,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:28,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:28,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:28,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:28,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:55:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:28,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641182708] [2025-04-26 16:55:28,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:28,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:28,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:28,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:28,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:28,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:28,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:28,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:28,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:28,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash -193376986, now seen corresponding path program 1 times [2025-04-26 16:55:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:28,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285170330] [2025-04-26 16:55:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:28,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:28,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:28,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:28,906 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:55:28,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:28,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285170330] [2025-04-26 16:55:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285170330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265042937] [2025-04-26 16:55:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:28,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:28,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:28,937 INFO L87 Difference]: Start difference. First operand 967 states and 2116 transitions. cyclomatic complexity: 1285 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:28,978 INFO L93 Difference]: Finished difference Result 1149 states and 2478 transitions. [2025-04-26 16:55:28,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1149 states and 2478 transitions. [2025-04-26 16:55:28,985 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 206 [2025-04-26 16:55:28,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1149 states to 1133 states and 2458 transitions. [2025-04-26 16:55:28,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 452 [2025-04-26 16:55:28,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 452 [2025-04-26 16:55:28,994 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1133 states and 2458 transitions. [2025-04-26 16:55:28,994 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:28,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1133 states and 2458 transitions. [2025-04-26 16:55:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states and 2458 transitions. [2025-04-26 16:55:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1093. [2025-04-26 16:55:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1093 states have (on average 2.1948764867337602) internal successors, (in total 2399), 1092 states have internal predecessors, (2399), 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:55:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 2399 transitions. [2025-04-26 16:55:29,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1093 states and 2399 transitions. [2025-04-26 16:55:29,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:29,020 INFO L438 stractBuchiCegarLoop]: Abstraction has 1093 states and 2399 transitions. [2025-04-26 16:55:29,020 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:29,021 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1093 states and 2399 transitions. [2025-04-26 16:55:29,024 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 192 [2025-04-26 16:55:29,024 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:29,024 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:29,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:29,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:29,025 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_3) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_3} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_3} AuxVars[] AssignedVars[q1_back]" "[109] L73-1-->L36: 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]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: 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:55:29,025 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:29,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -561007387, now seen corresponding path program 1 times [2025-04-26 16:55:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648300301] [2025-04-26 16:55:29,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:29,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:29,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:29,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:29,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:29,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:29,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2025-04-26 16:55:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053180705] [2025-04-26 16:55:29,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:29,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:29,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:29,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:29,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:29,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:29,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2037783495, now seen corresponding path program 1 times [2025-04-26 16:55:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658269420] [2025-04-26 16:55:29,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:29,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:29,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:29,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:29,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:29,190 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:29,191 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:29,191 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:29,191 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:29,191 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:29,191 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,191 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:29,191 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:29,191 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:29,191 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:29,191 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:29,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:29,327 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:29,327 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:29,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,329 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:55:29,331 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:55:29,332 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:55:29,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,345 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,351 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:55:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,353 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:55:29,354 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:55:29,356 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:55:29,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,370 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:29,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,378 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:55:29,380 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:55:29,381 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:55:29,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,395 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:29,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,404 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:55:29,405 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:55:29,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:55:29,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,419 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:29,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,427 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:55:29,428 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:55:29,429 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:55:29,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,444 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,450 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:55:29,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,452 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:55:29,464 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:55:29,464 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:55:29,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,478 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,483 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:55:29,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,485 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:55:29,487 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:55:29,488 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:55:29,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,504 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,510 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:55:29,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,512 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:29,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:55:29,515 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:55:29,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,532 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:29,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:55:29,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,541 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:55:29,542 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:55:29,543 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:55:29,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:29,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:29,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:29,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:29,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:29,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:29,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:29,566 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:29,566 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:55:29,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:29,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:29,568 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:55:29,569 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:55:29,570 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:29,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:29,586 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:29,586 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:29,586 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:29,591 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:55:29,592 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:29,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:29,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:29,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:29,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:29,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:29,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:29,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:29,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:29,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:29,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:29,624 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:55:29,624 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:55:29,625 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1093 states and 2399 transitions. cyclomatic complexity: 1461 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:55:29,665 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1093 states and 2399 transitions. cyclomatic complexity: 1461. 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 3037 states and 6821 transitions. Complement of second has 5 states. [2025-04-26 16:55:29,666 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:55:29,666 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:55:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-26 16:55:29,667 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 53 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:29,667 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:29,667 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 53 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:29,667 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:29,667 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 53 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:29,667 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:29,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3037 states and 6821 transitions. [2025-04-26 16:55:29,683 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 246 [2025-04-26 16:55:29,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3037 states to 2401 states and 5426 transitions. [2025-04-26 16:55:29,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 733 [2025-04-26 16:55:29,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 836 [2025-04-26 16:55:29,698 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2401 states and 5426 transitions. [2025-04-26 16:55:29,698 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:29,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2401 states and 5426 transitions. [2025-04-26 16:55:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states and 5426 transitions. [2025-04-26 16:55:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2017. [2025-04-26 16:55:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2017 states have (on average 2.343083787803669) internal successors, (in total 4726), 2016 states have internal predecessors, (4726), 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:55:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4726 transitions. [2025-04-26 16:55:29,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2017 states and 4726 transitions. [2025-04-26 16:55:29,734 INFO L438 stractBuchiCegarLoop]: Abstraction has 2017 states and 4726 transitions. [2025-04-26 16:55:29,734 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:29,734 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2017 states and 4726 transitions. [2025-04-26 16:55:29,741 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 202 [2025-04-26 16:55:29,741 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:29,741 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:29,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:29,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:29,742 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L36: 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]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: 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]" "[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:55:29,742 INFO L754 eck$LassoCheckResult]: Loop: "[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:29,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -560427281, now seen corresponding path program 1 times [2025-04-26 16:55:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622093257] [2025-04-26 16:55:29,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:29,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:29,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:29,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:29,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:55:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417417426] [2025-04-26 16:55:29,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:29,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:29,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:29,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:29,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:29,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1699701807, now seen corresponding path program 1 times [2025-04-26 16:55:29,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565237379] [2025-04-26 16:55:29,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:29,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:29,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:29,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:29,789 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:55:29,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:29,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565237379] [2025-04-26 16:55:29,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565237379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:29,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:29,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646575061] [2025-04-26 16:55:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:29,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:29,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:29,814 INFO L87 Difference]: Start difference. First operand 2017 states and 4726 transitions. cyclomatic complexity: 2968 Second operand has 3 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 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:55:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:29,850 INFO L93 Difference]: Finished difference Result 2716 states and 6350 transitions. [2025-04-26 16:55:29,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2716 states and 6350 transitions. [2025-04-26 16:55:29,864 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 272 [2025-04-26 16:55:29,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2716 states to 2598 states and 6137 transitions. [2025-04-26 16:55:29,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 828 [2025-04-26 16:55:29,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 830 [2025-04-26 16:55:29,879 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2598 states and 6137 transitions. [2025-04-26 16:55:29,879 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:29,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2598 states and 6137 transitions. [2025-04-26 16:55:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states and 6137 transitions. [2025-04-26 16:55:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2539. [2025-04-26 16:55:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 2539 states have (on average 2.380464749901536) internal successors, (in total 6044), 2538 states have internal predecessors, (6044), 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:55:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 6044 transitions. [2025-04-26 16:55:29,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2539 states and 6044 transitions. [2025-04-26 16:55:29,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:29,940 INFO L438 stractBuchiCegarLoop]: Abstraction has 2539 states and 6044 transitions. [2025-04-26 16:55:29,940 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:29,940 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2539 states and 6044 transitions. [2025-04-26 16:55:29,948 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 252 [2025-04-26 16:55:29,948 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:29,948 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:29,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:29,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:29,949 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L36: 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]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: 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]" "[89] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_3) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_3} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_3} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:55:29,949 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:29,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash -560427307, now seen corresponding path program 2 times [2025-04-26 16:55:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870039771] [2025-04-26 16:55:29,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:29,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:29,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:29,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:29,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:29,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:29,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2025-04-26 16:55:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892973268] [2025-04-26 16:55:29,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:29,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:29,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:29,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:29,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:29,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:29,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:29,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1699726921, now seen corresponding path program 2 times [2025-04-26 16:55:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:29,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876578043] [2025-04-26 16:55:29,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:29,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:29,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:29,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:29,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:29,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:29,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:29,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:29,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:29,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:29,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:30,089 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:30,089 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:30,089 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:30,089 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:30,089 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:30,089 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,089 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:30,089 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:30,089 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:55:30,089 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:30,089 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:30,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,214 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:30,215 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:30,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,217 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:55:30,218 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:55:30,219 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:55:30,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,232 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:55:30,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,239 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:55:30,239 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:55:30,240 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:55:30,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,254 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,260 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:55:30,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,262 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:55:30,263 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:55:30,264 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:55:30,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,277 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:30,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,284 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:55:30,285 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:55:30,286 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:55:30,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,299 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,305 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:55:30,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,307 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:55:30,307 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:55:30,309 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:55:30,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,323 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,328 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:55:30,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,330 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:55:30,332 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:55:30,333 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:55:30,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,350 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:30,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,358 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:55:30,359 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:55:30,360 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:55:30,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,376 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:30,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,383 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:55:30,385 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:55:30,386 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:55:30,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:30,409 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:30,409 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:55:30,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,411 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:55:30,413 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:55:30,414 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:30,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:30,430 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:30,430 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:30,430 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:30,436 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:55:30,437 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:30,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:30,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:30,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:30,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:30,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:30,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:30,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:30,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:30,472 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:30,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:30,474 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:55:30,474 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:55:30,474 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2539 states and 6044 transitions. cyclomatic complexity: 3871 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:55:30,572 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2539 states and 6044 transitions. cyclomatic complexity: 3871. 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 8002 states and 19141 transitions. Complement of second has 5 states. [2025-04-26 16:55:30,573 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:55:30,574 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:55:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-26 16:55:30,575 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:30,575 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:30,575 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:30,575 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:30,575 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:30,575 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:30,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8002 states and 19141 transitions. [2025-04-26 16:55:30,614 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 350 [2025-04-26 16:55:30,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8002 states to 5998 states and 14293 transitions. [2025-04-26 16:55:30,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1584 [2025-04-26 16:55:30,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1779 [2025-04-26 16:55:30,658 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5998 states and 14293 transitions. [2025-04-26 16:55:30,658 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:30,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5998 states and 14293 transitions. [2025-04-26 16:55:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states and 14293 transitions. [2025-04-26 16:55:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 2936. [2025-04-26 16:55:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2936 states have (on average 2.3981607629427795) internal successors, (in total 7041), 2935 states have internal predecessors, (7041), 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:55:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 7041 transitions. [2025-04-26 16:55:30,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2936 states and 7041 transitions. [2025-04-26 16:55:30,759 INFO L438 stractBuchiCegarLoop]: Abstraction has 2936 states and 7041 transitions. [2025-04-26 16:55:30,759 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:55:30,759 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2936 states and 7041 transitions. [2025-04-26 16:55:30,767 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 262 [2025-04-26 16:55:30,767 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:30,767 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:30,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:30,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:30,768 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_3) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_3} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_3} AuxVars[] AssignedVars[q1_back]" "[109] L73-1-->L36: 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]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: 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]" "[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[94] L37-->L37-1: Formula: (and (= (+ v_C_5 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:55:30,768 INFO L754 eck$LassoCheckResult]: Loop: "[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:30,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1253220505, now seen corresponding path program 1 times [2025-04-26 16:55:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:30,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539378164] [2025-04-26 16:55:30,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:30,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:30,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:30,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:30,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:30,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:30,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2025-04-26 16:55:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:30,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184542919] [2025-04-26 16:55:30,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:30,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:30,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:30,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:30,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,789 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:30,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:30,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:30,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:30,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1754059191, now seen corresponding path program 1 times [2025-04-26 16:55:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:30,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745574370] [2025-04-26 16:55:30,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:30,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:30,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:30,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:30,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:30,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,000 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:31,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:31,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:31,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:31,000 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:31,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:31,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:31,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:55:31,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:31,000 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:31,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,173 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:31,174 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:31,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,176 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:55:31,177 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:55:31,178 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:55:31,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,192 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,197 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:55:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,200 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:55:31,201 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:55:31,202 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:55:31,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,218 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,225 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:55:31,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,228 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:55:31,229 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:55:31,229 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:55:31,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,243 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,251 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:55:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,253 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:55:31,254 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:55:31,256 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:55:31,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,271 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:31,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,280 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:55:31,281 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:55:31,283 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:55:31,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:31,307 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:31,307 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:31,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,309 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:55:31,310 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:55:31,311 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:31,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:31,327 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:31,327 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:31,328 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:31,333 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:55:31,334 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:31,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:31,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:31,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:31,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:31,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:31,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:31,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:31,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:31,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:31,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:31,383 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:55:31,384 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:55:31,384 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2936 states and 7041 transitions. cyclomatic complexity: 4501 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,461 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2936 states and 7041 transitions. cyclomatic complexity: 4501. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8229 states and 19449 transitions. Complement of second has 5 states. [2025-04-26 16:55:31,461 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:55:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-26 16:55:31,462 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:31,462 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,462 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:31,462 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,462 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:55:31,462 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8229 states and 19449 transitions. [2025-04-26 16:55:31,506 INFO L131 ngComponentsAnalysis]: Automaton has 181 accepting balls. 404 [2025-04-26 16:55:31,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8229 states to 6883 states and 16355 transitions. [2025-04-26 16:55:31,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1669 [2025-04-26 16:55:31,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1744 [2025-04-26 16:55:31,555 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6883 states and 16355 transitions. [2025-04-26 16:55:31,555 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:31,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6883 states and 16355 transitions. [2025-04-26 16:55:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states and 16355 transitions. [2025-04-26 16:55:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 6242. [2025-04-26 16:55:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6242 states, 6242 states have (on average 2.4221403396347325) internal successors, (in total 15119), 6241 states have internal predecessors, (15119), 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:55:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 15119 transitions. [2025-04-26 16:55:31,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6242 states and 15119 transitions. [2025-04-26 16:55:31,713 INFO L438 stractBuchiCegarLoop]: Abstraction has 6242 states and 15119 transitions. [2025-04-26 16:55:31,713 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:55:31,713 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6242 states and 15119 transitions. [2025-04-26 16:55:31,730 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 328 [2025-04-26 16:55:31,730 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:31,731 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:31,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:31,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:31,731 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_3) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_3} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_3} AuxVars[] AssignedVars[q1_back]" "[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L73-1-->L36: 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]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: 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]" "[89] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_3) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_3} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_3} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:55:31,731 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:31,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1801886255, now seen corresponding path program 1 times [2025-04-26 16:55:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887898308] [2025-04-26 16:55:31,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:31,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:31,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 4 times [2025-04-26 16:55:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230651048] [2025-04-26 16:55:31,738 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:55:31,741 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:31,741 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:31,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:31,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:31,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,743 INFO L85 PathProgramCache]: Analyzing trace with hash -740867661, now seen corresponding path program 1 times [2025-04-26 16:55:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426010845] [2025-04-26 16:55:31,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:31,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:31,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,978 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:31,978 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:31,978 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:31,978 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:31,978 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:31,978 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,978 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:31,978 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:31,979 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:55:31,979 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:31,979 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:31,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,122 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:32,122 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:32,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,125 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:55:32,126 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:55:32,127 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:55:32,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,141 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,147 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:55:32,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,149 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:55:32,150 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:55:32,152 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:55:32,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,165 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,173 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:55:32,174 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:55:32,176 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:55:32,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,198 INFO L229 MonitoredProcess]: Starting monitored process 37 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:55:32,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:55:32,200 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:55:32,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,213 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,221 INFO L229 MonitoredProcess]: Starting monitored process 38 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:55:32,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:55:32,232 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:55:32,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,250 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,257 INFO L229 MonitoredProcess]: Starting monitored process 39 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:55:32,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:55:32,260 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:55:32,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,276 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:32,281 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:55:32,282 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:32,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,284 INFO L229 MonitoredProcess]: Starting monitored process 40 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:55:32,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:55:32,286 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:32,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:55:32,302 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:32,303 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:32,303 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:32,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,312 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:55:32,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:32,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:32,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,347 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,350 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:55:32,351 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:55:32,351 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6242 states and 15119 transitions. cyclomatic complexity: 9661 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:55:32,428 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6242 states and 15119 transitions. cyclomatic complexity: 9661. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 13076 states and 30924 transitions. Complement of second has 5 states. [2025-04-26 16:55:32,428 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:55:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:55:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-26 16:55:32,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:32,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,432 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:32,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:32,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:32,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,471 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:55:32,471 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:32,471 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6242 states and 15119 transitions. cyclomatic complexity: 9661 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:55:32,564 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6242 states and 15119 transitions. cyclomatic complexity: 9661. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 13076 states and 30924 transitions. Complement of second has 5 states. [2025-04-26 16:55:32,564 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:55:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:55:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-26 16:55:32,565 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:32,565 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,565 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:32,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:32,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:32,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,597 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,598 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:55:32,599 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 1 loop predicates [2025-04-26 16:55:32,599 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6242 states and 15119 transitions. cyclomatic complexity: 9661 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:55:32,698 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6242 states and 15119 transitions. cyclomatic complexity: 9661. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 14125 states and 33869 transitions. Complement of second has 5 states. [2025-04-26 16:55:32,699 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:55:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:55:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-26 16:55:32,699 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:32,699 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,699 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:32,699 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,699 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:55:32,700 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14125 states and 33869 transitions. [2025-04-26 16:55:32,782 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-04-26 16:55:32,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14125 states to 7045 states and 16797 transitions. [2025-04-26 16:55:32,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1350 [2025-04-26 16:55:32,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1543 [2025-04-26 16:55:32,822 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7045 states and 16797 transitions. [2025-04-26 16:55:32,822 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:32,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7045 states and 16797 transitions. [2025-04-26 16:55:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7045 states and 16797 transitions. [2025-04-26 16:55:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7045 to 3265. [2025-04-26 16:55:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3265 states, 3265 states have (on average 2.3611026033690656) internal successors, (in total 7709), 3264 states have internal predecessors, (7709), 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:55:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 7709 transitions. [2025-04-26 16:55:32,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3265 states and 7709 transitions. [2025-04-26 16:55:32,904 INFO L438 stractBuchiCegarLoop]: Abstraction has 3265 states and 7709 transitions. [2025-04-26 16:55:32,904 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:55:32,904 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3265 states and 7709 transitions. [2025-04-26 16:55:32,914 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 54 [2025-04-26 16:55:32,914 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:32,914 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:32,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:32,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:32,915 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_3) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_3} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_3} AuxVars[] AssignedVars[q1_back]" "[109] L73-1-->L36: 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]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: 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]" "[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[94] L37-->L37-1: Formula: (and (= (+ v_C_5 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" "[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L37-->L37-1: Formula: (and (= (+ v_C_5 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_5, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:55:32,915 INFO L754 eck$LassoCheckResult]: Loop: "[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:32,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1458733914, now seen corresponding path program 1 times [2025-04-26 16:55:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49723277] [2025-04-26 16:55:32,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:32,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:32,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:32,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:32,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2025-04-26 16:55:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928315306] [2025-04-26 16:55:32,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:32,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1683956092, now seen corresponding path program 1 times [2025-04-26 16:55:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40979579] [2025-04-26 16:55:32,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:32,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:32,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:32,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:32,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,174 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:33,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:33,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:33,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:33,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:33,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:33,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:33,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:55:33,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:33,174 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:33,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,393 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:33,393 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:33,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,395 INFO L229 MonitoredProcess]: Starting monitored process 41 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:55:33,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:55:33,397 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:55:33,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,411 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:55:33,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,418 INFO L229 MonitoredProcess]: Starting monitored process 42 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:55:33,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:55:33,420 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:55:33,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,440 INFO L229 MonitoredProcess]: Starting monitored process 43 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:55:33,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:55:33,442 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:55:33,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:33,462 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:33,462 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:33,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,466 INFO L229 MonitoredProcess]: Starting monitored process 44 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:55:33,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:55:33,467 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:33,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,483 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:33,483 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:33,483 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:33,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,494 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:55:33,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:33,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,538 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,540 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:55:33,540 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:55:33,540 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3265 states and 7709 transitions. cyclomatic complexity: 4761 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:55:33,575 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3265 states and 7709 transitions. cyclomatic complexity: 4761. 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 5430 states and 12578 transitions. Complement of second has 5 states. [2025-04-26 16:55:33,576 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:55:33,576 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:55:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:55:33,576 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:33,576 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,576 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:33,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:33,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,612 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:55:33,612 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:33,612 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3265 states and 7709 transitions. cyclomatic complexity: 4761 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:55:33,647 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3265 states and 7709 transitions. cyclomatic complexity: 4761. 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 5430 states and 12578 transitions. Complement of second has 5 states. [2025-04-26 16:55:33,648 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:55:33,648 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:55:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:55:33,649 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:33,649 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,649 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:33,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:33,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:33,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,686 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:55:33,686 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 1 loop predicates [2025-04-26 16:55:33,687 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3265 states and 7709 transitions. cyclomatic complexity: 4761 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:55:33,731 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3265 states and 7709 transitions. cyclomatic complexity: 4761. 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 7513 states and 17212 transitions. Complement of second has 5 states. [2025-04-26 16:55:33,731 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:55:33,732 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:55:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-26 16:55:33,732 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:33,732 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,732 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:55:33,732 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,732 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:55:33,732 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7513 states and 17212 transitions. [2025-04-26 16:55:33,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:33,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7513 states to 0 states and 0 transitions. [2025-04-26 16:55:33,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:33,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:33,762 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:33,762 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:33,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:33,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:33,762 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:33,762 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:55:33,762 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:33,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:33,762 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:33,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,780 INFO L201 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:33 BoogieIcfgContainer [2025-04-26 16:55:33,780 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:33,781 INFO L158 Benchmark]: Toolchain (without parser) took 7052.34ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 84.6MB in the beginning and 178.9MB in the end (delta: -94.3MB). Peak memory consumption was 125.0MB. Max. memory is 8.0GB. [2025-04-26 16:55:33,781 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:33,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.53ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:33,781 INFO L158 Benchmark]: Boogie Preprocessor took 27.67ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:33,781 INFO L158 Benchmark]: RCFGBuilder took 203.63ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 70.9MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:33,781 INFO L158 Benchmark]: BuchiAutomizer took 6788.90ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 70.7MB in the beginning and 178.9MB in the end (delta: -108.1MB). Peak memory consumption was 112.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:33,782 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.76ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.53ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.67ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 203.63ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 70.9MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6788.90ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 70.7MB in the beginning and 178.9MB in the end (delta: -108.1MB). Peak memory consumption was 112.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 8126 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 260 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital69 mio100 ax100 hnf100 lsp50 ukn94 mio100 lsp66 div100 bol100 ite100 ukn100 eq187 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 388, Number of transitions in reduction automaton: 1292, Number of states in reduction automaton: 593, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (2 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:33,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...