/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/dot-product.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:32,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:32,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:32,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:32,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:32,519 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:32,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:32,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:32,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:32,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:32,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:32,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:32,539 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:32,539 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:32,539 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:32,539 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:32,539 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:32,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:32,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:32,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:32,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:32,543 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:32,544 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:32,544 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:32,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:32,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:32,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:32,794 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:32,795 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:32,796 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/dot-product.wvr.bpl [2025-04-26 16:55:32,797 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dot-product.wvr.bpl' [2025-04-26 16:55:32,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:32,819 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:32,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:32,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:32,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:32,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,854 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:32,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:32,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:32,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:32,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:32,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:32,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:32,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:32,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:32,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/1) ... [2025-04-26 16:55:32,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:32,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,911 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:32,916 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:32,939 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:32,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:32,939 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:32,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:32,939 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:32,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:32,939 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:32,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:32,940 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:32,979 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:32,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:33,077 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:33,078 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:33,099 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:33,099 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:33,100 INFO L201 PluginConnector]: Adding new model dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:33 BoogieIcfgContainer [2025-04-26 16:55:33,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:33,102 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:33,102 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:33,109 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:33,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:33,110 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:32" (1/2) ... [2025-04-26 16:55:33,111 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53f2c717 and model type dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:33, skipping insertion in model container [2025-04-26 16:55:33,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:33,111 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:33" (2/2) ... [2025-04-26 16:55:33,112 INFO L376 chiAutomizerObserver]: Analyzing ICFG dot-product.wvr.bpl [2025-04-26 16:55:33,161 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:33,199 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:33,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,202 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:33,204 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:33,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:55:33,279 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:55:33,282 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:33,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:55:33,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:55:33,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 16:55:33,290 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 16:55:33,297 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:33,416 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 16:55:33,417 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:33,417 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 16:55:33,417 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 16:55:33,417 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 16:55:33,417 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 16:55:33,417 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:55:33,417 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:33,419 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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,426 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:33,427 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:33,427 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:33,427 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:33,427 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:33,427 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:33,427 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:33,427 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:33,429 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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,448 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:33,448 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:33,448 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:33,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:33,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:33,452 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:33,453 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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,458 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:33,458 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:33,458 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:33,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:33,459 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:33,462 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:33,462 INFO L754 eck$LassoCheckResult]: Loop: "[68] L24-1-->L24: 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[]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" [2025-04-26 16:55:33,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash 87810836, now seen corresponding path program 1 times [2025-04-26 16:55:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33812569] [2025-04-26 16:55:33,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:33,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:33,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:55:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107445787] [2025-04-26 16:55:33,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,551 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,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,553 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,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1513130346, now seen corresponding path program 1 times [2025-04-26 16:55:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945397858] [2025-04-26 16:55:33,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:33,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:33,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:33,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:33,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,755 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:33,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:33,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:33,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:33,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:33,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:33,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:33,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:33,757 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:33,757 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:33,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,993 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:33,996 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:33,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,999 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:34,001 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:34,002 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:34,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:34,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:34,024 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:34,030 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:34,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:34,036 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:34,037 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:34,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:34,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:34,054 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:34,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:34,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,062 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:34,063 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:34,065 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:34,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:34,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:34,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:34,077 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:34,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:55:34,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,085 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:34,086 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:34,087 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:34,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:34,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:34,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:34,098 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:34,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:34,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,106 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:34,108 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:34,110 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:34,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:34,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:34,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:34,144 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:55:34,144 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:55:34,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,147 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:34,149 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:34,150 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:34,167 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:34,167 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:34,167 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:34,168 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:34,174 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:34,176 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:34,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:34,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:34,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:34,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:34,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:34,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:34,258 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:34,276 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:34,278 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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 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:34,376 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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 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 260 states and 529 transitions. Complement of second has 7 states. [2025-04-26 16:55:34,377 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:34,380 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:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-26 16:55:34,384 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:55:34,386 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:34,386 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:34,386 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:34,386 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:55:34,386 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:34,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 529 transitions. [2025-04-26 16:55:34,393 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:34,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 119 states and 241 transitions. [2025-04-26 16:55:34,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 16:55:34,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 16:55:34,400 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 241 transitions. [2025-04-26 16:55:34,400 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:34,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 241 transitions. [2025-04-26 16:55:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 241 transitions. [2025-04-26 16:55:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2025-04-26 16:55:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.019230769230769) internal successors, (in total 210), 103 states have internal predecessors, (210), 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:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 210 transitions. [2025-04-26 16:55:34,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 16:55:34,428 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 16:55:34,428 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:34,428 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 210 transitions. [2025-04-26 16:55:34,430 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:34,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:34,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:34,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:34,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:34,430 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L60-1-->L35-1: 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:34,430 INFO L754 eck$LassoCheckResult]: Loop: "[72] L35-1-->L35: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L35-->L35-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (+ (select (select v_mult_6 (select v_A_6 v_j_8)) (select v_B_6 v_j_8)) v_res2_8) v_res2_7)) InVars {A=v_A_6, res2=v_res2_8, j=v_j_8, mult=v_mult_6, B=v_B_6} OutVars{A=v_A_6, res2=v_res2_7, j=v_j_7, mult=v_mult_6, B=v_B_6} AuxVars[] AssignedVars[j, res2]" [2025-04-26 16:55:34,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash 337598622, now seen corresponding path program 1 times [2025-04-26 16:55:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964918565] [2025-04-26 16:55:34,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:34,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:34,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:34,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,501 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:34,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:34,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964918565] [2025-04-26 16:55:34,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964918565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:34,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:34,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147936323] [2025-04-26 16:55:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:34,507 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:34,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:55:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444968542] [2025-04-26 16:55:34,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:34,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:34,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:34,536 INFO L87 Difference]: Start difference. First operand 104 states and 210 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:34,578 INFO L93 Difference]: Finished difference Result 106 states and 212 transitions. [2025-04-26 16:55:34,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 212 transitions. [2025-04-26 16:55:34,579 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:34,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 212 transitions. [2025-04-26 16:55:34,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 16:55:34,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 16:55:34,580 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 212 transitions. [2025-04-26 16:55:34,580 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:34,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 16:55:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 212 transitions. [2025-04-26 16:55:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-04-26 16:55:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.0096153846153846) internal successors, (in total 209), 103 states have internal predecessors, (209), 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:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 209 transitions. [2025-04-26 16:55:34,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 16:55:34,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:55:34,586 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 16:55:34,586 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:34,586 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 209 transitions. [2025-04-26 16:55:34,587 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:34,587 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:34,587 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:34,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:34,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:34,587 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L24-1-->L24: 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[]" "[84] L60-1-->L35-1: 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]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:34,587 INFO L754 eck$LassoCheckResult]: Loop: "[72] L35-1-->L35: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L35-->L35-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (+ (select (select v_mult_6 (select v_A_6 v_j_8)) (select v_B_6 v_j_8)) v_res2_8) v_res2_7)) InVars {A=v_A_6, res2=v_res2_8, j=v_j_8, mult=v_mult_6, B=v_B_6} OutVars{A=v_A_6, res2=v_res2_7, j=v_j_7, mult=v_mult_6, B=v_B_6} AuxVars[] AssignedVars[j, res2]" [2025-04-26 16:55:34,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1875666529, now seen corresponding path program 1 times [2025-04-26 16:55:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578903164] [2025-04-26 16:55:34,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:34,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:34,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:34,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:34,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 2 times [2025-04-26 16:55:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27364515] [2025-04-26 16:55:34,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,611 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:34,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:34,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1370727645, now seen corresponding path program 1 times [2025-04-26 16:55:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086325632] [2025-04-26 16:55:34,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:34,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:34,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,692 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:34,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:34,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086325632] [2025-04-26 16:55:34,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086325632] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:34,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:34,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:55:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068815625] [2025-04-26 16:55:34,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:34,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:34,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:34,712 INFO L87 Difference]: Start difference. First operand 104 states and 209 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 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:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:34,817 INFO L93 Difference]: Finished difference Result 154 states and 290 transitions. [2025-04-26 16:55:34,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 290 transitions. [2025-04-26 16:55:34,818 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 16:55:34,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 152 states and 288 transitions. [2025-04-26 16:55:34,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 16:55:34,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 16:55:34,821 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 288 transitions. [2025-04-26 16:55:34,821 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:34,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 288 transitions. [2025-04-26 16:55:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 288 transitions. [2025-04-26 16:55:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2025-04-26 16:55:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.983739837398374) internal successors, (in total 244), 122 states have internal predecessors, (244), 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:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 244 transitions. [2025-04-26 16:55:34,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 16:55:34,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:55:34,829 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 16:55:34,829 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:34,829 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 244 transitions. [2025-04-26 16:55:34,830 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:34,830 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:34,830 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:34,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:34,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:34,831 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L24-1-->L24: 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[]" "[84] L60-1-->L35-1: 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]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[68] L24-1-->L24: 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[]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:34,831 INFO L754 eck$LassoCheckResult]: Loop: "[72] L35-1-->L35: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L35-->L35-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (+ (select (select v_mult_6 (select v_A_6 v_j_8)) (select v_B_6 v_j_8)) v_res2_8) v_res2_7)) InVars {A=v_A_6, res2=v_res2_8, j=v_j_8, mult=v_mult_6, B=v_B_6} OutVars{A=v_A_6, res2=v_res2_7, j=v_j_7, mult=v_mult_6, B=v_B_6} AuxVars[] AssignedVars[j, res2]" [2025-04-26 16:55:34,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1370726753, now seen corresponding path program 2 times [2025-04-26 16:55:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659955666] [2025-04-26 16:55:34,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 16:55:34,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:34,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:34,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:34,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:34,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 3 times [2025-04-26 16:55:34,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230810826] [2025-04-26 16:55:34,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:34,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,848 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:34,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:34,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1286552545, now seen corresponding path program 2 times [2025-04-26 16:55:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245124571] [2025-04-26 16:55:34,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 16:55:34,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:34,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:34,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:34,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:34,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:35,049 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:35,049 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:35,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:35,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:35,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:35,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:35,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:35,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:35,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:35,049 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:35,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,253 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:35,253 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:35,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,256 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:35,258 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:35,258 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:35,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,275 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:55:35,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,283 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:35,285 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:35,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:35,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,301 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,307 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:35,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,309 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:35,310 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:35,310 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:35,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,325 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:55:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,333 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:35,335 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:35,336 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:35,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,357 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,363 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:35,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,366 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:35,368 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:35,370 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:35,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,384 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,392 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:35,394 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:35,395 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:35,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:35,419 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:35,420 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:55:35,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,421 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:35,423 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:35,423 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:35,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,441 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:35,441 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:35,441 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:55:35,446 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:35,450 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:35,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:35,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:35,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:35,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:35,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:35,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:35,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:35,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:35,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:35,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:35,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:35,498 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:35,499 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:35,499 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148 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:35,542 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148. 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 267 states and 557 transitions. Complement of second has 6 states. [2025-04-26 16:55:35,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:35,545 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:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 16:55:35,546 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:35,546 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:35,546 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:35,546 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:35,546 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:55:35,546 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:35,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 557 transitions. [2025-04-26 16:55:35,549 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:35,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 158 states and 310 transitions. [2025-04-26 16:55:35,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 16:55:35,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 16:55:35,550 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 310 transitions. [2025-04-26 16:55:35,551 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:35,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 310 transitions. [2025-04-26 16:55:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 310 transitions. [2025-04-26 16:55:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-04-26 16:55:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 2.074380165289256) internal successors, (in total 251), 120 states have internal predecessors, (251), 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:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 251 transitions. [2025-04-26 16:55:35,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 16:55:35,556 INFO L438 stractBuchiCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 16:55:35,556 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:35,556 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 251 transitions. [2025-04-26 16:55:35,557 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:35,557 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:35,557 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:35,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:35,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:35,557 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L24-1-->L24: 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[]" "[84] L60-1-->L35-1: 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]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[87] L61-->L46-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]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[71] L35-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 16:55:35,557 INFO L754 eck$LassoCheckResult]: Loop: "[76] L46-1-->L46: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[78] L46-->L46-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= (+ v_res2_12 (select (select v_mult_8 (select v_A_8 v_k_8)) (select v_B_8 v_k_8))) v_res2_11)) InVars {A=v_A_8, res2=v_res2_12, k=v_k_8, mult=v_mult_8, B=v_B_8} OutVars{A=v_A_8, res2=v_res2_11, k=v_k_7, mult=v_mult_8, B=v_B_8} AuxVars[] AssignedVars[k, res2]" [2025-04-26 16:55:35,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1370708583, now seen corresponding path program 1 times [2025-04-26 16:55:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:35,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509669868] [2025-04-26 16:55:35,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:35,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:35,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:35,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:35,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:35,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:35,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:35,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:55:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:35,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848200419] [2025-04-26 16:55:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:35,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:35,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:35,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:35,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:35,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:35,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:35,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1304014043, now seen corresponding path program 1 times [2025-04-26 16:55:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:35,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251334617] [2025-04-26 16:55:35,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:35,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:35,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:35,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:35,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:35,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:35,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:35,712 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:35,712 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:35,713 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:35,713 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:35,713 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:35,713 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,713 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:35,713 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:35,713 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:35,713 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:35,713 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:35,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,866 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:35,866 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,870 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:35,871 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:35,872 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:35,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,887 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,895 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:35,896 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:35,897 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:35,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,912 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:55:35,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,922 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:35,924 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:35,925 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:35,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,945 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,951 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:35,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,954 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:35,954 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:35,956 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:35,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:35,981 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:35,981 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,983 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:35,984 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:35,985 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:36,000 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:36,000 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:36,000 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:36,000 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:55:36,006 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:36,006 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:36,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:36,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:36,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:36,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:36,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,060 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:36,060 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:36,061 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,108 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 224 states and 442 transitions. Complement of second has 6 states. [2025-04-26 16:55:36,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:55:36,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:36,110 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:36,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,111 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:55:36,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 442 transitions. [2025-04-26 16:55:36,112 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:36,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2025-04-26 16:55:36,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:36,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:36,113 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:36,113 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:36,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:36,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:36,113 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:36,113 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:36,113 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:36,113 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:36,113 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:36,127 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:36,128 INFO L201 PluginConnector]: Adding new model dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:36 BoogieIcfgContainer [2025-04-26 16:55:36,128 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:36,129 INFO L158 Benchmark]: Toolchain (without parser) took 3309.56ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 85.9MB in the beginning and 41.9MB in the end (delta: 44.0MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. [2025-04-26 16:55:36,131 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 86.9MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:36,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.63ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:36,131 INFO L158 Benchmark]: Boogie Preprocessor took 28.44ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:36,131 INFO L158 Benchmark]: RCFGBuilder took 214.62ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 73.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:36,131 INFO L158 Benchmark]: BuchiAutomizer took 3025.81ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.1MB in the beginning and 41.9MB in the end (delta: 31.2MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. [2025-04-26 16:55:36,132 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.18ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 86.9MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.63ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.44ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 214.62ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 73.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3025.81ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.1MB in the beginning and 41.9MB in the end (delta: 31.2MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 60 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital72 mio100 ax100 hnf100 lsp75 ukn81 mio100 lsp59 div100 bol100 ite100 ukn100 eq163 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 223, Number of transitions in reduction automaton: 227, Number of states in reduction automaton: 114, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 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:36,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... [2025-04-26 16:55:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:29,819 INFO L93 Difference]: Finished difference Result 10358 states and 19932 transitions. [2025-04-26 16:55:29,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10358 states and 19932 transitions. [2025-04-26 16:55:29,883 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 240 [2025-04-26 16:55:29,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10358 states to 9708 states and 18572 transitions. [2025-04-26 16:55:29,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1146 [2025-04-26 16:55:29,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1211 [2025-04-26 16:55:29,912 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9708 states and 18572 transitions. [2025-04-26 16:55:29,912 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:29,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9708 states and 18572 transitions. [2025-04-26 16:55:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9708 states and 18572 transitions. [2025-04-26 16:55:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9708 to 7389. [2025-04-26 16:55:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7389 states, 7389 states have (on average 1.9640005413452428) internal successors, (in total 14512), 7388 states have internal predecessors, (14512), 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,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 14512 transitions. [2025-04-26 16:55:29,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7389 states and 14512 transitions. [2025-04-26 16:55:29,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:55:29,995 INFO L438 stractBuchiCegarLoop]: Abstraction has 7389 states and 14512 transitions. [2025-04-26 16:55:29,995 INFO L340 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-04-26 16:55:29,995 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7389 states and 14512 transitions. [2025-04-26 16:55:30,014 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 177 [2025-04-26 16:55:30,015 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:30,015 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:30,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:30,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:30,015 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[138] L69-->L51: 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]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:30,015 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:30,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1218611340, now seen corresponding path program 2 times [2025-04-26 16:55:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:30,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441418652] [2025-04-26 16:55:30,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:30,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:55:30,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:55:30,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:30,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:30,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:55:30,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:55:30,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:30,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 5 times [2025-04-26 16:55:30,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:30,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141215023] [2025-04-26 16:55:30,054 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:55:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:30,058 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:30,059 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:30,059 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:30,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:30,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:30,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:30,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1707997965, now seen corresponding path program 2 times [2025-04-26 16:55:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:30,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968836884] [2025-04-26 16:55:30,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:30,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:30,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:30,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:30,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:30,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:30,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:30,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:30,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:30,237 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:30,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:30,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:30,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:30,238 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:30,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:30,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:30,238 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration16_Lasso [2025-04-26 16:55:30,238 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:30,238 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:30,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:30,423 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:30,423 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:30,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,426 INFO L229 MonitoredProcess]: Starting monitored process 45 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,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:55:30,427 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,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,442 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:30,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,450 INFO L229 MonitoredProcess]: Starting monitored process 46 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,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:55:30,453 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,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,467 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:30,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,474 INFO L229 MonitoredProcess]: Starting monitored process 47 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,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:55:30,476 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,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,488 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:55:30,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,496 INFO L229 MonitoredProcess]: Starting monitored process 48 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,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:55:30,498 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,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,511 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:30,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:55:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,517 INFO L229 MonitoredProcess]: Starting monitored process 49 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,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:55:30,519 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,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:30,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:30,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:30,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:30,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:30,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:30,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:30,544 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:55:30,544 INFO L437 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:55:30,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,546 INFO L229 MonitoredProcess]: Starting monitored process 50 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,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:55:30,548 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:30,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:30,564 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:30,564 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:30,564 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select A k1)_3, k2) = 1*v_rep(select A k1)_3 - 1*k2 Supporting invariants [] [2025-04-26 16:55:30,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:55:30,572 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:30,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:30,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:55:30,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:55:30,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:30,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:30,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:30,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:30,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:30,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:30,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:30,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:30,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:30,616 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,617 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:30,619 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7389 states and 14512 transitions. cyclomatic complexity: 7722 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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,727 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7389 states and 14512 transitions. cyclomatic complexity: 7722. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 14892 states and 29403 transitions. Complement of second has 7 states. [2025-04-26 16:55:30,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:55:30,728 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:55:30,728 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:30,728 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 24 letters. Loop has 3 letters. [2025-04-26 16:55:30,728 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:30,728 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 21 letters. Loop has 6 letters. [2025-04-26 16:55:30,728 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:30,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14892 states and 29403 transitions. [2025-04-26 16:55:30,794 INFO L131 ngComponentsAnalysis]: Automaton has 111 accepting balls. 357 [2025-04-26 16:55:30,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14892 states to 11987 states and 23410 transitions. [2025-04-26 16:55:30,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1203 [2025-04-26 16:55:30,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1335 [2025-04-26 16:55:30,842 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11987 states and 23410 transitions. [2025-04-26 16:55:30,843 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:30,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11987 states and 23410 transitions. [2025-04-26 16:55:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11987 states and 23410 transitions. [2025-04-26 16:55:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11987 to 9952. [2025-04-26 16:55:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9952 states, 9952 states have (on average 1.9695538585209003) internal successors, (in total 19601), 9951 states have internal predecessors, (19601), 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,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9952 states to 9952 states and 19601 transitions. [2025-04-26 16:55:31,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9952 states and 19601 transitions. [2025-04-26 16:55:31,134 INFO L438 stractBuchiCegarLoop]: Abstraction has 9952 states and 19601 transitions. [2025-04-26 16:55:31,134 INFO L340 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-04-26 16:55:31,134 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9952 states and 19601 transitions. [2025-04-26 16:55:31,173 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 258 [2025-04-26 16:55:31,174 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:31,174 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:31,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:31,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:31,176 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[138] L69-->L51: 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]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:31,176 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:31,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash 377788917, now seen corresponding path program 3 times [2025-04-26 16:55:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090090387] [2025-04-26 16:55:31,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:55:31,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:55:31,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:31,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:55:31,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:55:31,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 6 times [2025-04-26 16:55:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181725185] [2025-04-26 16:55:31,190 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:55:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,193 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:31,194 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:31,194 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:55:31,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:31,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:31,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1895436010, now seen corresponding path program 3 times [2025-04-26 16:55:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533921390] [2025-04-26 16:55:31,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:31,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:31,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:31,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:31,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:31,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,409 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:31,410 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:31,410 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:31,410 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:31,410 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:31,410 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,410 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:31,410 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:31,410 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration17_Lasso [2025-04-26 16:55:31,410 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:31,410 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:31,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,598 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:31,598 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,602 INFO L229 MonitoredProcess]: Starting monitored process 51 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,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:55:31,604 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,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,618 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:55:31,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,628 INFO L229 MonitoredProcess]: Starting monitored process 52 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,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:55:31,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:31,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,648 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:55:31,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,655 INFO L229 MonitoredProcess]: Starting monitored process 53 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,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:55:31,657 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,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,670 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:55:31,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,677 INFO L229 MonitoredProcess]: Starting monitored process 54 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,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:55:31,679 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,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,692 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:55:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,699 INFO L229 MonitoredProcess]: Starting monitored process 55 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,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:55:31,701 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,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:31,730 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:55:31,730 INFO L437 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:55:31,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,732 INFO L229 MonitoredProcess]: Starting monitored process 56 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,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:55:31,734 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:31,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:31,751 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:31,751 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:31,751 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select A k1)_4, k2) = 1*v_rep(select A k1)_4 - 1*k2 Supporting invariants [] [2025-04-26 16:55:31,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:55:31,763 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:55:31,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:55:31,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:55:31,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:31,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:31,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:31,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:31,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:31,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:31,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:31,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:31,815 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,815 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:31,815 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9952 states and 19601 transitions. cyclomatic complexity: 10667 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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,957 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9952 states and 19601 transitions. cyclomatic complexity: 10667. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 24950 states and 49058 transitions. Complement of second has 7 states. [2025-04-26 16:55:31,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 16:55:31,958 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 22 letters. Loop has 3 letters. [2025-04-26 16:55:31,958 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,958 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 25 letters. Loop has 3 letters. [2025-04-26 16:55:31,958 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,958 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 22 letters. Loop has 6 letters. [2025-04-26 16:55:31,958 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24950 states and 49058 transitions. [2025-04-26 16:55:32,168 INFO L131 ngComponentsAnalysis]: Automaton has 153 accepting balls. 483 [2025-04-26 16:55:32,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24950 states to 19955 states and 38929 transitions. [2025-04-26 16:55:32,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1875 [2025-04-26 16:55:32,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1918 [2025-04-26 16:55:32,253 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19955 states and 38929 transitions. [2025-04-26 16:55:32,254 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:32,254 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19955 states and 38929 transitions. [2025-04-26 16:55:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19955 states and 38929 transitions. [2025-04-26 16:55:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19955 to 14020. [2025-04-26 16:55:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14020 states, 14020 states have (on average 1.9982881597717546) internal successors, (in total 28016), 14019 states have internal predecessors, (28016), 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,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14020 states to 14020 states and 28016 transitions. [2025-04-26 16:55:32,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14020 states and 28016 transitions. [2025-04-26 16:55:32,484 INFO L438 stractBuchiCegarLoop]: Abstraction has 14020 states and 28016 transitions. [2025-04-26 16:55:32,484 INFO L340 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-04-26 16:55:32,484 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14020 states and 28016 transitions. [2025-04-26 16:55:32,598 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 288 [2025-04-26 16:55:32,598 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:32,598 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:32,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:32,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:32,599 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[138] L69-->L51: 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]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[125] L53-1-->L57: Formula: (<= (select v_A_6 v_k1_5) v_k2_5) InVars {A=v_A_6, k1=v_k1_5, k2=v_k2_5} OutVars{A=v_A_6, k1=v_k1_5, k2=v_k2_5} AuxVars[] AssignedVars[]" "[127] L57-->L51: Formula: (= (+ v_k1_7 1) v_k1_6) InVars {k1=v_k1_7} OutVars{k1=v_k1_6} AuxVars[] AssignedVars[k1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:32,599 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:32,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 590082938, now seen corresponding path program 1 times [2025-04-26 16:55:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083957881] [2025-04-26 16:55:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:55:32,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:55:32,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:55:32,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:55:32,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 7 times [2025-04-26 16:55:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149836165] [2025-04-26 16:55:32,607 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:55:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:32,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:32,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:32,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:32,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash -140211387, now seen corresponding path program 1 times [2025-04-26 16:55:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364017199] [2025-04-26 16:55:32,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:55:32,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:55:32,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:32,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:32,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364017199] [2025-04-26 16:55:32,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364017199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:32,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986926868] [2025-04-26 16:55:32,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:32,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,770 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-26 16:55:32,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:55:32,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:55:32,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:33,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:33,171 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-26 16:55:33,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-04-26 16:55:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:33,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986926868] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:33,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:33,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2025-04-26 16:55:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932815004] [2025-04-26 16:55:33,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:33,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-26 16:55:33,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2025-04-26 16:55:33,291 INFO L87 Difference]: Start difference. First operand 14020 states and 28016 transitions. cyclomatic complexity: 15386 Second operand has 25 states, 25 states have (on average 2.52) internal successors, (in total 63), 24 states have internal predecessors, (63), 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:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:36,090 INFO L93 Difference]: Finished difference Result 31360 states and 61884 transitions. [2025-04-26 16:55:36,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31360 states and 61884 transitions. [2025-04-26 16:55:36,283 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 372 [2025-04-26 16:55:36,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31360 states to 31270 states and 61748 transitions. [2025-04-26 16:55:36,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2724 [2025-04-26 16:55:36,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2724 [2025-04-26 16:55:36,392 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31270 states and 61748 transitions. [2025-04-26 16:55:36,392 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:36,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31270 states and 61748 transitions. [2025-04-26 16:55:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31270 states and 61748 transitions. [2025-04-26 16:55:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31270 to 14975. [2025-04-26 16:55:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14975 states, 14975 states have (on average 2.0068113522537563) internal successors, (in total 30052), 14974 states have internal predecessors, (30052), 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:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14975 states to 14975 states and 30052 transitions. [2025-04-26 16:55:36,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14975 states and 30052 transitions. [2025-04-26 16:55:36,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-26 16:55:36,722 INFO L438 stractBuchiCegarLoop]: Abstraction has 14975 states and 30052 transitions. [2025-04-26 16:55:36,722 INFO L340 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-04-26 16:55:36,722 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14975 states and 30052 transitions. [2025-04-26 16:55:36,769 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 288 [2025-04-26 16:55:36,769 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:36,769 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:36,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:36,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:36,771 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:36,771 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:36,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1285091469, now seen corresponding path program 1 times [2025-04-26 16:55:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:36,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464066296] [2025-04-26 16:55:36,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:36,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:36,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:36,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:36,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:36,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464066296] [2025-04-26 16:55:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464066296] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:36,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980227497] [2025-04-26 16:55:36,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:36,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:36,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:36,832 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:36,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-26 16:55:36,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:36,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:36,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:36,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:37,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980227497] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:37,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-26 16:55:37,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 7] total 13 [2025-04-26 16:55:37,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093968665] [2025-04-26 16:55:37,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:37,013 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:37,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 5 times [2025-04-26 16:55:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:37,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047765371] [2025-04-26 16:55:37,014 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:55:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:37,015 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:37,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:37,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:37,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:37,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:37,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:37,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:37,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:37,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:37,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:37,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:55:37,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-26 16:55:37,034 INFO L87 Difference]: Start difference. First operand 14975 states and 30052 transitions. cyclomatic complexity: 16554 Second operand has 8 states, 8 states have (on average 3.0) internal successors, (in total 24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:37,282 INFO L93 Difference]: Finished difference Result 18932 states and 36907 transitions. [2025-04-26 16:55:37,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18932 states and 36907 transitions. [2025-04-26 16:55:37,388 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 330 [2025-04-26 16:55:37,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18932 states to 18853 states and 36789 transitions. [2025-04-26 16:55:37,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1641 [2025-04-26 16:55:37,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1641 [2025-04-26 16:55:37,473 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18853 states and 36789 transitions. [2025-04-26 16:55:37,473 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:37,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18853 states and 36789 transitions. [2025-04-26 16:55:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18853 states and 36789 transitions. [2025-04-26 16:55:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18853 to 16413. [2025-04-26 16:55:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16413 states, 16413 states have (on average 2.008651678547493) internal successors, (in total 32968), 16412 states have internal predecessors, (32968), 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:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16413 states to 16413 states and 32968 transitions. [2025-04-26 16:55:37,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16413 states and 32968 transitions. [2025-04-26 16:55:37,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:55:37,838 INFO L438 stractBuchiCegarLoop]: Abstraction has 16413 states and 32968 transitions. [2025-04-26 16:55:37,838 INFO L340 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-04-26 16:55:37,838 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16413 states and 32968 transitions. [2025-04-26 16:55:37,882 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 288 [2025-04-26 16:55:37,882 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:37,882 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:37,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:37,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:37,883 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:37,883 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:37,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1290578469, now seen corresponding path program 2 times [2025-04-26 16:55:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:37,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678913497] [2025-04-26 16:55:37,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:37,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-26 16:55:37,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:37,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:37,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:55:37,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:37,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678913497] [2025-04-26 16:55:37,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678913497] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:37,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703124660] [2025-04-26 16:55:37,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:37,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:37,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:37,932 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:37,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-26 16:55:37,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-26 16:55:37,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:37,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:37,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:55:37,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:55:38,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 16:55:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703124660] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:38,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 16:55:38,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-04-26 16:55:38,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063662013] [2025-04-26 16:55:38,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:38,027 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:38,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 6 times [2025-04-26 16:55:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:38,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189703387] [2025-04-26 16:55:38,027 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:55:38,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:38,029 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:38,029 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:38,029 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:55:38,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:38,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:38,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:38,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:38,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:38,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-26 16:55:38,044 INFO L87 Difference]: Start difference. First operand 16413 states and 32968 transitions. cyclomatic complexity: 18216 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (in total 22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:38,208 INFO L93 Difference]: Finished difference Result 21122 states and 41793 transitions. [2025-04-26 16:55:38,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21122 states and 41793 transitions. [2025-04-26 16:55:38,300 INFO L131 ngComponentsAnalysis]: Automaton has 145 accepting balls. 471 [2025-04-26 16:55:38,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21122 states to 20010 states and 39635 transitions. [2025-04-26 16:55:38,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1959 [2025-04-26 16:55:38,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1963 [2025-04-26 16:55:38,377 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20010 states and 39635 transitions. [2025-04-26 16:55:38,378 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:38,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20010 states and 39635 transitions. [2025-04-26 16:55:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states and 39635 transitions. [2025-04-26 16:55:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 18276. [2025-04-26 16:55:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18276 states, 18276 states have (on average 2.019260231998249) internal successors, (in total 36904), 18275 states have internal predecessors, (36904), 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:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18276 states to 18276 states and 36904 transitions. [2025-04-26 16:55:38,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 16:55:38,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:55:38,716 INFO L438 stractBuchiCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 16:55:38,716 INFO L340 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-04-26 16:55:38,716 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18276 states and 36904 transitions. [2025-04-26 16:55:38,767 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 16:55:38,767 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:38,767 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:38,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:38,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:38,768 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[105] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] L69-->L51: 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]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[125] L53-1-->L57: Formula: (<= (select v_A_6 v_k1_5) v_k2_5) InVars {A=v_A_6, k1=v_k1_5, k2=v_k2_5} OutVars{A=v_A_6, k1=v_k1_5, k2=v_k2_5} AuxVars[] AssignedVars[]" "[127] L57-->L51: Formula: (= (+ v_k1_7 1) v_k1_6) InVars {k1=v_k1_7} OutVars{k1=v_k1_6} AuxVars[] AssignedVars[k1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:38,768 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:38,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1628817585, now seen corresponding path program 3 times [2025-04-26 16:55:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:38,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316011900] [2025-04-26 16:55:38,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:38,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:38,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:55:38,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:38,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:55:38,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:38,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:38,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:38,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:38,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 8 times [2025-04-26 16:55:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:38,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300739513] [2025-04-26 16:55:38,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:38,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:38,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:38,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:38,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:38,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:38,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:38,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:38,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash -435710290, now seen corresponding path program 1 times [2025-04-26 16:55:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:38,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862521302] [2025-04-26 16:55:38,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:38,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:38,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:38,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:38,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862521302] [2025-04-26 16:55:38,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862521302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:38,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276622121] [2025-04-26 16:55:38,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:38,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:38,911 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:38,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-26 16:55:38,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:38,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:38,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:38,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 16:55:38,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:39,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:39,185 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-26 16:55:39,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-04-26 16:55:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:39,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276622121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:39,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:39,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-04-26 16:55:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40779128] [2025-04-26 16:55:39,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:39,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:39,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-26 16:55:39,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-04-26 16:55:39,382 INFO L87 Difference]: Start difference. First operand 18276 states and 36904 transitions. cyclomatic complexity: 20400 Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (in total 65), 23 states have internal predecessors, (65), 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:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:41,095 INFO L93 Difference]: Finished difference Result 23691 states and 46643 transitions. [2025-04-26 16:55:41,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23691 states and 46643 transitions. [2025-04-26 16:55:41,195 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 381 [2025-04-26 16:55:41,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23691 states to 23601 states and 46507 transitions. [2025-04-26 16:55:41,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1940 [2025-04-26 16:55:41,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1940 [2025-04-26 16:55:41,285 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23601 states and 46507 transitions. [2025-04-26 16:55:41,285 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:41,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23601 states and 46507 transitions. [2025-04-26 16:55:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23601 states and 46507 transitions. [2025-04-26 16:55:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23601 to 18276. [2025-04-26 16:55:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18276 states, 18276 states have (on average 2.019260231998249) internal successors, (in total 36904), 18275 states have internal predecessors, (36904), 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:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18276 states to 18276 states and 36904 transitions. [2025-04-26 16:55:41,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 16:55:41,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-26 16:55:41,518 INFO L438 stractBuchiCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 16:55:41,518 INFO L340 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-04-26 16:55:41,518 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18276 states and 36904 transitions. [2025-04-26 16:55:41,612 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 16:55:41,612 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:41,612 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:41,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:41,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:41,613 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:41,613 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:41,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1358570326, now seen corresponding path program 4 times [2025-04-26 16:55:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931575009] [2025-04-26 16:55:41,614 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:55:41,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:41,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:41,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:41,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:41,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,629 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 7 times [2025-04-26 16:55:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362973671] [2025-04-26 16:55:41,630 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:55:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:41,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:41,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:41,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:41,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1691867904, now seen corresponding path program 1 times [2025-04-26 16:55:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524991371] [2025-04-26 16:55:41,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:41,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:41,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:41,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:41,834 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:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:41,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524991371] [2025-04-26 16:55:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524991371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 16:55:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966551305] [2025-04-26 16:55:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:41,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-26 16:55:41,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-26 16:55:41,850 INFO L87 Difference]: Start difference. First operand 18276 states and 36904 transitions. cyclomatic complexity: 20400 Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (in total 28), 13 states have internal predecessors, (28), 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:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:43,018 INFO L93 Difference]: Finished difference Result 43896 states and 86067 transitions. [2025-04-26 16:55:43,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43896 states and 86067 transitions. [2025-04-26 16:55:43,300 INFO L131 ngComponentsAnalysis]: Automaton has 280 accepting balls. 936 [2025-04-26 16:55:43,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43896 states to 41033 states and 80180 transitions. [2025-04-26 16:55:43,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3644 [2025-04-26 16:55:43,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3648 [2025-04-26 16:55:43,507 INFO L74 IsDeterministic]: Start isDeterministic. Operand 41033 states and 80180 transitions. [2025-04-26 16:55:43,507 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:43,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41033 states and 80180 transitions. [2025-04-26 16:55:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41033 states and 80180 transitions. [2025-04-26 16:55:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41033 to 24362. [2025-04-26 16:55:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24362 states, 24362 states have (on average 2.0456038092110664) internal successors, (in total 49835), 24361 states have internal predecessors, (49835), 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:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24362 states to 24362 states and 49835 transitions. [2025-04-26 16:55:44,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24362 states and 49835 transitions. [2025-04-26 16:55:44,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-26 16:55:44,008 INFO L438 stractBuchiCegarLoop]: Abstraction has 24362 states and 49835 transitions. [2025-04-26 16:55:44,008 INFO L340 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-04-26 16:55:44,008 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24362 states and 49835 transitions. [2025-04-26 16:55:44,080 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 16:55:44,080 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:44,081 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:44,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:44,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:44,082 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[138] L69-->L51: 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]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[125] L53-1-->L57: Formula: (<= (select v_A_6 v_k1_5) v_k2_5) InVars {A=v_A_6, k1=v_k1_5, k2=v_k2_5} OutVars{A=v_A_6, k1=v_k1_5, k2=v_k2_5} AuxVars[] AssignedVars[]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[127] L57-->L51: Formula: (= (+ v_k1_7 1) v_k1_6) InVars {k1=v_k1_7} OutVars{k1=v_k1_6} AuxVars[] AssignedVars[k1]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:44,082 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:44,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash -758813408, now seen corresponding path program 1 times [2025-04-26 16:55:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:44,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430597225] [2025-04-26 16:55:44,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:44,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:44,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:44,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:44,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:44,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:44,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430597225] [2025-04-26 16:55:44,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430597225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:44,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:44,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:55:44,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964832972] [2025-04-26 16:55:44,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:44,130 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:44,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 9 times [2025-04-26 16:55:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:44,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428517771] [2025-04-26 16:55:44,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:44,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:44,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:44,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:44,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:44,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:44,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:44,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:44,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:44,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:44,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:44,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:55:44,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:55:44,147 INFO L87 Difference]: Start difference. First operand 24362 states and 49835 transitions. cyclomatic complexity: 27884 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:44,436 INFO L93 Difference]: Finished difference Result 26540 states and 53644 transitions. [2025-04-26 16:55:44,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26540 states and 53644 transitions. [2025-04-26 16:55:44,556 INFO L131 ngComponentsAnalysis]: Automaton has 108 accepting balls. 360 [2025-04-26 16:55:44,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26540 states to 26536 states and 53638 transitions. [2025-04-26 16:55:44,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1965 [2025-04-26 16:55:44,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1965 [2025-04-26 16:55:44,663 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26536 states and 53638 transitions. [2025-04-26 16:55:44,663 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:44,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26536 states and 53638 transitions. [2025-04-26 16:55:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26536 states and 53638 transitions. [2025-04-26 16:55:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26536 to 24371. [2025-04-26 16:55:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24371 states, 24371 states have (on average 2.045422838619671) internal successors, (in total 49849), 24370 states have internal predecessors, (49849), 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:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24371 states to 24371 states and 49849 transitions. [2025-04-26 16:55:44,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24371 states and 49849 transitions. [2025-04-26 16:55:44,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-26 16:55:44,961 INFO L438 stractBuchiCegarLoop]: Abstraction has 24371 states and 49849 transitions. [2025-04-26 16:55:44,961 INFO L340 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-04-26 16:55:44,961 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24371 states and 49849 transitions. [2025-04-26 16:55:45,030 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 16:55:45,030 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:45,030 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:45,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:45,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:45,031 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[138] L69-->L51: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[125] L53-1-->L57: Formula: (<= (select v_A_6 v_k1_5) v_k2_5) InVars {A=v_A_6, k1=v_k1_5, k2=v_k2_5} OutVars{A=v_A_6, k1=v_k1_5, k2=v_k2_5} AuxVars[] AssignedVars[]" "[127] L57-->L51: Formula: (= (+ v_k1_7 1) v_k1_6) InVars {k1=v_k1_7} OutVars{k1=v_k1_6} AuxVars[] AssignedVars[k1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:45,031 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 16:55:45,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 165998037, now seen corresponding path program 2 times [2025-04-26 16:55:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:45,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769560044] [2025-04-26 16:55:45,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:45,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:55:45,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:55:45,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:45,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:45,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:55:45,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:55:45,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:45,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:45,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 10 times [2025-04-26 16:55:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:45,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460371556] [2025-04-26 16:55:45,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:45,040 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 16:55:45,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:45,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:45,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:45,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:45,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:45,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:45,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:45,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:45,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1740287754, now seen corresponding path program 1 times [2025-04-26 16:55:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:45,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614401450] [2025-04-26 16:55:45,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:45,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:45,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:55:45,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:55:45,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:45,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:45,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:55:45,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:55:45,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:45,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:45,208 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:45,208 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:45,208 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:45,208 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:45,208 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:45,208 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:45,208 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:45,208 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:45,209 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration24_Lasso [2025-04-26 16:55:45,209 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:45,209 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:45,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:45,365 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:45,365 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:45,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:45,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:45,376 INFO L229 MonitoredProcess]: Starting monitored process 61 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:45,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:55:45,378 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:45,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:45,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:45,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:45,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:45,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:45,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:45,390 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:45,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:55:45,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:45,397 INFO L229 MonitoredProcess]: Starting monitored process 62 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:45,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:55:45,398 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:45,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:45,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:45,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:45,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:45,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:45,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:45,411 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:45,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:55:45,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:45,418 INFO L229 MonitoredProcess]: Starting monitored process 63 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:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:55:45,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:45,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:45,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:45,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:45,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:45,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:45,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:45,435 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:45,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 16:55:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:45,443 INFO L229 MonitoredProcess]: Starting monitored process 64 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:45,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:55:45,444 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:45,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:45,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:45,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:45,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:45,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:45,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:45,459 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:45,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:55:45,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:45,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:45,466 INFO L229 MonitoredProcess]: Starting monitored process 65 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:45,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:55:45,468 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:45,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:45,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:45,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:45,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:45,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:45,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:45,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:45,493 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:45,493 INFO L437 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:55:45,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:45,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:45,495 INFO L229 MonitoredProcess]: Starting monitored process 66 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:45,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:55:45,496 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:45,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 16:55:45,511 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:45,512 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:45,512 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k2, v_rep(select A k1)_5) = -1*k2 + 1*v_rep(select A k1)_5 Supporting invariants [] [2025-04-26 16:55:45,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:55:45,519 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:45,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:45,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:55:45,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:55:45,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:45,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:45,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:45,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:45,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:45,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:45,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:45,573 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:45,573 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:45,574 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:45,777 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 42505 states and 86068 transitions. Complement of second has 7 states. [2025-04-26 16:55:45,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 16:55:45,778 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 16:55:45,778 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:45,778 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:45,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:45,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:55:45,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:55:45,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:45,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:45,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:45,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:45,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:45,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:45,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:45,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:45,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:45,828 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:45,829 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:45,829 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:46,023 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 42505 states and 86068 transitions. Complement of second has 7 states. [2025-04-26 16:55:46,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 16:55:46,026 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 16:55:46,026 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:46,026 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:46,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:46,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:55:46,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:55:46,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:46,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:46,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:46,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:46,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:46,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:46,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:46,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:46,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:46,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:46,078 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:46,078 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:46,078 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:46,323 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 42219 states and 87568 transitions. Complement of second has 6 states. [2025-04-26 16:55:46,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-04-26 16:55:46,324 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 16:55:46,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:46,324 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 29 letters. Loop has 3 letters. [2025-04-26 16:55:46,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:46,324 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 26 letters. Loop has 6 letters. [2025-04-26 16:55:46,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:46,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42219 states and 87568 transitions. [2025-04-26 16:55:46,539 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 318 [2025-04-26 16:55:46,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42219 states to 23733 states and 46905 transitions. [2025-04-26 16:55:46,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1548 [2025-04-26 16:55:46,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1621 [2025-04-26 16:55:46,641 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23733 states and 46905 transitions. [2025-04-26 16:55:46,641 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:46,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23733 states and 46905 transitions. [2025-04-26 16:55:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23733 states and 46905 transitions. [2025-04-26 16:55:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23733 to 12819. [2025-04-26 16:55:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12819 states, 12819 states have (on average 1.992979171542242) internal successors, (in total 25548), 12818 states have internal predecessors, (25548), 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:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12819 states to 12819 states and 25548 transitions. [2025-04-26 16:55:46,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12819 states and 25548 transitions. [2025-04-26 16:55:46,844 INFO L438 stractBuchiCegarLoop]: Abstraction has 12819 states and 25548 transitions. [2025-04-26 16:55:46,844 INFO L340 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-04-26 16:55:46,844 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12819 states and 25548 transitions. [2025-04-26 16:55:46,877 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 16:55:46,877 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:46,877 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:46,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:46,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:46,878 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:46,878 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:46,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1210505774, now seen corresponding path program 3 times [2025-04-26 16:55:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:46,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310264555] [2025-04-26 16:55:46,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:46,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:55:46,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:55:46,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:55:46,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:46,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310264555] [2025-04-26 16:55:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310264555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:46,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751578188] [2025-04-26 16:55:46,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:46,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:46,923 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:46,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-26 16:55:46,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:55:46,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:55:46,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:55:46,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:46,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:55:46,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:47,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:47,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751578188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:47,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:47,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-26 16:55:47,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660202056] [2025-04-26 16:55:47,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:47,070 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:47,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 8 times [2025-04-26 16:55:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:47,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158892364] [2025-04-26 16:55:47,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:47,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:47,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:47,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:47,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:47,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:47,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:47,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:47,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-26 16:55:47,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-26 16:55:47,085 INFO L87 Difference]: Start difference. First operand 12819 states and 25548 transitions. cyclomatic complexity: 13890 Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (in total 55), 12 states have internal predecessors, (55), 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:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:47,261 INFO L93 Difference]: Finished difference Result 15422 states and 30331 transitions. [2025-04-26 16:55:47,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15422 states and 30331 transitions. [2025-04-26 16:55:47,324 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 16:55:47,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15422 states to 15338 states and 30216 transitions. [2025-04-26 16:55:47,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 813 [2025-04-26 16:55:47,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 813 [2025-04-26 16:55:47,380 INFO L74 IsDeterministic]: Start isDeterministic. Operand 15338 states and 30216 transitions. [2025-04-26 16:55:47,380 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:47,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15338 states and 30216 transitions. [2025-04-26 16:55:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15338 states and 30216 transitions. [2025-04-26 16:55:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15338 to 13645. [2025-04-26 16:55:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13645 states, 13645 states have (on average 1.9794796628801758) internal successors, (in total 27010), 13644 states have internal predecessors, (27010), 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:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13645 states to 13645 states and 27010 transitions. [2025-04-26 16:55:47,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13645 states and 27010 transitions. [2025-04-26 16:55:47,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 16:55:47,559 INFO L438 stractBuchiCegarLoop]: Abstraction has 13645 states and 27010 transitions. [2025-04-26 16:55:47,559 INFO L340 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-04-26 16:55:47,559 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13645 states and 27010 transitions. [2025-04-26 16:55:47,595 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 16:55:47,595 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:47,595 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:47,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:47,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:47,596 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:47,596 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:47,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash 150624626, now seen corresponding path program 4 times [2025-04-26 16:55:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:47,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239889433] [2025-04-26 16:55:47,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:47,598 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:55:47,600 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:55:47,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:55:47,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:47,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:47,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239889433] [2025-04-26 16:55:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239889433] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:47,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044650712] [2025-04-26 16:55:47,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:47,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:47,643 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:47,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-26 16:55:47,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:55:47,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:55:47,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 16:55:47,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:47,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:55:47,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:55:47,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044650712] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:47,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:47,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2025-04-26 16:55:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249908561] [2025-04-26 16:55:47,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:47,825 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:47,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 9 times [2025-04-26 16:55:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:47,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567021189] [2025-04-26 16:55:47,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:47,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:47,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:47,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:47,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:47,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:47,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:47,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:47,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-26 16:55:47,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-04-26 16:55:47,845 INFO L87 Difference]: Start difference. First operand 13645 states and 27010 transitions. cyclomatic complexity: 14553 Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (in total 65), 15 states have internal predecessors, (65), 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:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:48,091 INFO L93 Difference]: Finished difference Result 21480 states and 41633 transitions. [2025-04-26 16:55:48,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21480 states and 41633 transitions. [2025-04-26 16:55:48,178 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 468 [2025-04-26 16:55:48,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21480 states to 19677 states and 38162 transitions. [2025-04-26 16:55:48,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1556 [2025-04-26 16:55:48,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1566 [2025-04-26 16:55:48,247 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19677 states and 38162 transitions. [2025-04-26 16:55:48,248 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:48,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19677 states and 38162 transitions. [2025-04-26 16:55:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19677 states and 38162 transitions. [2025-04-26 16:55:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19677 to 14678. [2025-04-26 16:55:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14678 states, 14678 states have (on average 1.9841940318844529) internal successors, (in total 29124), 14677 states have internal predecessors, (29124), 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:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14678 states to 14678 states and 29124 transitions. [2025-04-26 16:55:48,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14678 states and 29124 transitions. [2025-04-26 16:55:48,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 16:55:48,442 INFO L438 stractBuchiCegarLoop]: Abstraction has 14678 states and 29124 transitions. [2025-04-26 16:55:48,442 INFO L340 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-04-26 16:55:48,442 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14678 states and 29124 transitions. [2025-04-26 16:55:48,473 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 16:55:48,473 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:48,473 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:48,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:48,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:48,474 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:48,474 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:48,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash -85097311, now seen corresponding path program 5 times [2025-04-26 16:55:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:48,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762617393] [2025-04-26 16:55:48,474 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:55:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:48,476 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 16:55:48,477 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:48,477 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:48,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:48,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:48,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:48,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:48,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 10 times [2025-04-26 16:55:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:48,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824924021] [2025-04-26 16:55:48,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:48,481 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 16:55:48,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:48,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:48,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:48,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:48,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:48,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:48,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1103171115, now seen corresponding path program 1 times [2025-04-26 16:55:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:48,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325861873] [2025-04-26 16:55:48,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:48,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:55:48,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:48,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:48,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325861873] [2025-04-26 16:55:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325861873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:48,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888802754] [2025-04-26 16:55:48,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:48,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:48,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:48,567 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:48,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-26 16:55:48,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:55:48,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:48,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:48,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:55:48,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:48,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:48,719 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-26 16:55:48,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-04-26 16:55:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888802754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:48,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:48,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2025-04-26 16:55:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393815358] [2025-04-26 16:55:48,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-26 16:55:48,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-04-26 16:55:48,750 INFO L87 Difference]: Start difference. First operand 14678 states and 29124 transitions. cyclomatic complexity: 15681 Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (in total 61), 15 states have internal predecessors, (61), 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:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:49,446 INFO L93 Difference]: Finished difference Result 33718 states and 64551 transitions. [2025-04-26 16:55:49,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33718 states and 64551 transitions. [2025-04-26 16:55:49,589 INFO L131 ngComponentsAnalysis]: Automaton has 130 accepting balls. 390 [2025-04-26 16:55:49,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33718 states to 31955 states and 60601 transitions. [2025-04-26 16:55:49,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2248 [2025-04-26 16:55:49,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2250 [2025-04-26 16:55:49,712 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31955 states and 60601 transitions. [2025-04-26 16:55:49,712 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:49,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31955 states and 60601 transitions. [2025-04-26 16:55:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31955 states and 60601 transitions. [2025-04-26 16:55:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31955 to 21625. [2025-04-26 16:55:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21625 states, 21625 states have (on average 1.976) internal successors, (in total 42731), 21624 states have internal predecessors, (42731), 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:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21625 states to 21625 states and 42731 transitions. [2025-04-26 16:55:50,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21625 states and 42731 transitions. [2025-04-26 16:55:50,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-26 16:55:50,188 INFO L438 stractBuchiCegarLoop]: Abstraction has 21625 states and 42731 transitions. [2025-04-26 16:55:50,188 INFO L340 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-04-26 16:55:50,188 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21625 states and 42731 transitions. [2025-04-26 16:55:50,249 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 16:55:50,249 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:50,249 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:50,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:50,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:50,250 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:50,250 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:50,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2096861993, now seen corresponding path program 6 times [2025-04-26 16:55:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:50,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937655427] [2025-04-26 16:55:50,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:55:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:50,253 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-26 16:55:50,255 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:50,255 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 16:55:50,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:50,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:50,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:50,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:50,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:50,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:50,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:50,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 11 times [2025-04-26 16:55:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:50,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267467825] [2025-04-26 16:55:50,258 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:55:50,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:50,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:50,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:50,259 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:50,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:50,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:50,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:50,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:50,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:50,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:50,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:50,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1611164193, now seen corresponding path program 2 times [2025-04-26 16:55:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:50,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870406515] [2025-04-26 16:55:50,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:50,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-26 16:55:50,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:50,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:50,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:50,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:50,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:55:50,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:50,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:50,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:50,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:50,428 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:50,428 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:50,428 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:50,428 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:50,428 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:50,428 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:50,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:50,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:50,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration28_Lasso [2025-04-26 16:55:50,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:50,429 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:50,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:50,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:50,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:50,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:50,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:50,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:50,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:50,565 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:50,566 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:50,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:50,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,568 INFO L229 MonitoredProcess]: Starting monitored process 70 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:50,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:55:50,570 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:50,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:50,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:50,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:50,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:50,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:50,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:50,583 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:50,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 16:55:50,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:50,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,591 INFO L229 MonitoredProcess]: Starting monitored process 71 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:50,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:55:50,593 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:50,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:50,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:50,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:50,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:50,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:50,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:50,606 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:50,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-04-26 16:55:50,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:50,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,614 INFO L229 MonitoredProcess]: Starting monitored process 72 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:50,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:55:50,615 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:50,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:50,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:50,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:50,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:50,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:50,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:50,628 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:50,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 16:55:50,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:50,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,636 INFO L229 MonitoredProcess]: Starting monitored process 73 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:50,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:55:50,637 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:50,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:50,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:50,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:50,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:50,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:50,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:50,653 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:50,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-04-26 16:55:50,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:50,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,660 INFO L229 MonitoredProcess]: Starting monitored process 74 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:50,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:55:50,662 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:50,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:50,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:50,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:50,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:50,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:50,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:50,680 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:50,687 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:55:50,688 INFO L437 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:50,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:50,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,690 INFO L229 MonitoredProcess]: Starting monitored process 75 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:50,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:55:50,691 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:50,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 16:55:50,707 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:55:50,707 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:50,707 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j2) = -2*j2 + 1 Supporting invariants [-1*v_rep(select A 1)_5 + 1 >= 0] [2025-04-26 16:55:50,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 16:55:50,719 INFO L156 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:55:50,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:50,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:50,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:50,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:50,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:50,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:55:50,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:50,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:50,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:50,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:50,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:50,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:55:50,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:50,901 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:50,902 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-04-26 16:55:50,902 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851 Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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:51,047 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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 22915 states and 45010 transitions. Complement of second has 6 states. [2025-04-26 16:55:51,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 16:55:51,048 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 16:55:51,048 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,048 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:51,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:51,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:51,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:51,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:55:51,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:51,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:51,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:51,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:51,207 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:55:51,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:51,228 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:51,228 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2025-04-26 16:55:51,228 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851 Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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:51,365 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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 22915 states and 45010 transitions. Complement of second has 6 states. [2025-04-26 16:55:51,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 16:55:51,366 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 16:55:51,366 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,366 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:51,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:51,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:51,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:51,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:55:51,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:51,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:51,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:51,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:51,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:55:51,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:51,542 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:51,543 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-04-26 16:55:51,543 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851 Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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:51,913 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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 39393 states and 78722 transitions. Complement of second has 21 states. [2025-04-26 16:55:51,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 16:55:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2025-04-26 16:55:51,914 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 251 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 16:55:51,914 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,914 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 251 transitions. Stem has 31 letters. Loop has 3 letters. [2025-04-26 16:55:51,914 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,914 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 251 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 16:55:51,914 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39393 states and 78722 transitions. [2025-04-26 16:55:52,107 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 300 [2025-04-26 16:55:52,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39393 states to 34851 states and 69029 transitions. [2025-04-26 16:55:52,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2081 [2025-04-26 16:55:52,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2192 [2025-04-26 16:55:52,263 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34851 states and 69029 transitions. [2025-04-26 16:55:52,263 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:52,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34851 states and 69029 transitions. [2025-04-26 16:55:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34851 states and 69029 transitions. [2025-04-26 16:55:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34851 to 23105. [2025-04-26 16:55:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23105 states, 23105 states have (on average 1.9897424799826877) internal successors, (in total 45973), 23104 states have internal predecessors, (45973), 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:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23105 states to 23105 states and 45973 transitions. [2025-04-26 16:55:52,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23105 states and 45973 transitions. [2025-04-26 16:55:52,833 INFO L438 stractBuchiCegarLoop]: Abstraction has 23105 states and 45973 transitions. [2025-04-26 16:55:52,833 INFO L340 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-04-26 16:55:52,833 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23105 states and 45973 transitions. [2025-04-26 16:55:52,895 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 16:55:52,895 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:52,895 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:52,895 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:52,895 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:52,895 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:52,896 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 16:55:52,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1342404439, now seen corresponding path program 7 times [2025-04-26 16:55:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:52,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019419345] [2025-04-26 16:55:52,896 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:55:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:52,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:52,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:52,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:52,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:52,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:52,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:52,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 12 times [2025-04-26 16:55:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:52,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241807121] [2025-04-26 16:55:52,903 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:55:52,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:52,904 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:52,904 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:52,904 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:55:52,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:52,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:52,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:52,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:52,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1130265439, now seen corresponding path program 3 times [2025-04-26 16:55:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:52,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930638449] [2025-04-26 16:55:52,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:52,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-26 16:55:52,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:52,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:55:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:52,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:55:52,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:52,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,069 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:53,069 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:53,069 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:53,069 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:53,069 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:53,069 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,069 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:53,069 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:53,069 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration29_Lasso [2025-04-26 16:55:53,069 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:53,069 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:53,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,351 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:53,351 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:53,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,353 INFO L229 MonitoredProcess]: Starting monitored process 76 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:53,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 16:55:53,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:53,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,369 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-04-26 16:55:53,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,376 INFO L229 MonitoredProcess]: Starting monitored process 77 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:53,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 16:55:53,378 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:53,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,390 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:53,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,397 INFO L229 MonitoredProcess]: Starting monitored process 78 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:53,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 16:55:53,399 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:53,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:53,425 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:55:53,425 INFO L437 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:55:53,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,427 INFO L229 MonitoredProcess]: Starting monitored process 79 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:53,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 16:55:53,429 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:53,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 16:55:53,444 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:53,444 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:53,445 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j2, v_rep(select A j1)_4) = -1*j2 + 1*v_rep(select A j1)_4 Supporting invariants [] [2025-04-26 16:55:53,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 16:55:53,454 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-04-26 16:55:53,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:53,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:53,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:53,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:53,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,497 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:53,507 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:53,507 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:53,719 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 37630 states and 74229 transitions. Complement of second has 7 states. [2025-04-26 16:55:53,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-26 16:55:53,720 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 16:55:53,720 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,720 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:53,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:53,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:53,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:53,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:53,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,768 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:53,769 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:53,769 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:53,982 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 37630 states and 74229 transitions. Complement of second has 7 states. [2025-04-26 16:55:53,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-26 16:55:53,983 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 16:55:53,983 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,983 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:53,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:53,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:53,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:54,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:54,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,028 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:54,029 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:54,029 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:54,267 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 42293 states and 86298 transitions. Complement of second has 6 states. [2025-04-26 16:55:54,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:55:54,268 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 16:55:54,268 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,268 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 31 letters. Loop has 3 letters. [2025-04-26 16:55:54,268 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,268 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 16:55:54,269 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42293 states and 86298 transitions. [2025-04-26 16:55:54,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:54,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42293 states to 0 states and 0 transitions. [2025-04-26 16:55:54,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:54,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:54,541 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:54,541 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:54,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:54,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:54,541 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:54,541 INFO L340 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-04-26 16:55:54,541 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:54,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:54,541 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:54,551 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:54,552 INFO L201 PluginConnector]: Adding new model dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:54 BoogieIcfgContainer [2025-04-26 16:55:54,552 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:54,552 INFO L158 Benchmark]: Toolchain (without parser) took 34913.56ms. Allocated memory was 163.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 92.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 858.0MB. Max. memory is 8.0GB. [2025-04-26 16:55:54,553 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.91ms. Allocated memory is still 163.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:54,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.83ms. Allocated memory is still 163.6MB. Free memory was 92.2MB in the beginning and 89.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:54,553 INFO L158 Benchmark]: Boogie Preprocessor took 27.44ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:54,553 INFO L158 Benchmark]: RCFGBuilder took 218.48ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 78.7MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:54,553 INFO L158 Benchmark]: BuchiAutomizer took 34621.35ms. Allocated memory was 163.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 78.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 845.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:54,554 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.91ms. Allocated memory is still 163.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.83ms. Allocated memory is still 163.6MB. Free memory was 92.2MB in the beginning and 89.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.44ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 218.48ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 78.7MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 34621.35ms. Allocated memory was 163.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 78.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 845.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.5s and 30 iterations. TraceHistogramMax:3. Analysis of lassos took 10.0s. Construction of modules took 4.3s. Büchi inclusion checks took 15.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 28. Automata minimization 5.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 106197 StatesRemovedByMinimization, 28 NontrivialMinimizations. Non-live state removal took 4.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8917 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8901 mSDsluCounter, 7731 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5740 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10528 IncrementalHoareTripleChecker+Invalid, 10864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 1991 mSDtfsCounter, 10528 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc8 concLT0 SILN0 SILU9 SILI0 SILT0 lasso12 LassoPreprocessingBenchmarks: Lassos: inital75 mio100 ax100 hnf100 lsp61 ukn103 mio100 lsp54 div100 bol100 ite100 ukn100 eq181 hnf90 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 363, Number of transitions in reduction automaton: 1213, Number of states in reduction automaton: 666, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 29 terminating modules (17 trivial, 8 deterministic, 4 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + A[i1] and consists of 4 locations. One deterministic module has affine ranking function N + -1 * k1 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + M and consists of 4 locations. One deterministic module has affine ranking function A[0] + -1 * k2 and consists of 12 locations. One deterministic module has affine ranking function A[j1] + -1 * j2 and consists of 4 locations. One deterministic module has affine ranking function A[k1] + -1 * k2 and consists of 4 locations. One deterministic module has affine ranking function A[k1] + -1 * k2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i2 + A[i1] and consists of 4 locations. One nondeterministic module has affine ranking function A[k1] + -1 * k2 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j2 + 1 and consists of 13 locations. One nondeterministic module has affine ranking function A[j1] + -1 * j2 and consists of 4 locations. 17 modules have a trivial ranking function, the largest among these consists of 25 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:54,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:54,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:54,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:55,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-26 16:55:55,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:55,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:55,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-26 16:55:55,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...