/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/array-sum-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:24,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:24,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:24,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:24,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:24,184 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:24,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:24,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:24,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:24,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:24,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:24,207 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:24,207 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:24,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:24,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:24,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:24,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:24,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:24,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:24,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:24,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:24,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:24,209 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:24,209 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:24,209 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:24,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:24,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:24,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:24,440 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:24,441 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:24,443 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/array-sum-alt.wvr.bpl [2025-04-26 16:55:24,444 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum-alt.wvr.bpl' [2025-04-26 16:55:24,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:24,463 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:24,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:24,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:24,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:24,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,503 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:24,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:24,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:24,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:24,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:24,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:24,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:24,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:24,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:24,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/1) ... [2025-04-26 16:55:24,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,561 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:24,563 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:24,586 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:24,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:24,586 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:24,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:24,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:24,587 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:24,627 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:24,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:24,730 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:24,731 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:24,743 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:24,743 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:24,744 INFO L201 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:24 BoogieIcfgContainer [2025-04-26 16:55:24,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:24,745 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:24,745 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:24,751 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:24,751 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:24,751 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:24" (1/2) ... [2025-04-26 16:55:24,752 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b76ed37 and model type array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:24, skipping insertion in model container [2025-04-26 16:55:24,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:24,753 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:24" (2/2) ... [2025-04-26 16:55:24,754 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-alt.wvr.bpl [2025-04-26 16:55:24,790 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:24,833 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:24,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:24,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,836 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:24,837 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:24,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:55:24,902 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 16:55:24,904 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:24,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:55:24,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:55:24,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 16:55:24,911 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 16:55:24,918 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:25,031 WARN L140 AmpleReduction]: Number of pruned transitions: 209 [2025-04-26 16:55:25,032 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:25,032 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 52 [2025-04-26 16:55:25,032 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 16:55:25,032 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:116 [2025-04-26 16:55:25,032 WARN L145 AmpleReduction]: Times succ was already a loop node:17 [2025-04-26 16:55:25,032 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:88 [2025-04-26 16:55:25,032 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:25,035 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 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:25,040 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:25,040 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:25,040 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:25,040 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:25,040 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:25,040 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:25,040 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:25,040 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:25,042 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 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:25,056 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 16:55:25,056 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:25,057 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:25,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:25,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:25,060 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:25,060 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 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:25,064 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 16:55:25,064 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:25,064 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:25,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:25,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:25,068 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L49: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[49] L49-->L50: 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[]" "[45] L50-->L51: 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[]" "[40] L51-->L52: 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[]" "[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:25,068 INFO L754 eck$LassoCheckResult]: Loop: "[68] L21-->L22: 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] L22-->L23: Formula: (= (+ v_res1_2 (select v_A_1 v_i_2)) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1} AuxVars[] AssignedVars[res1]" "[71] L23-->L21: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:55:25,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash 86468260, now seen corresponding path program 1 times [2025-04-26 16:55:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648201904] [2025-04-26 16:55:25,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:25,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:25,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:25,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:25,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 97380, now seen corresponding path program 1 times [2025-04-26 16:55:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768649842] [2025-04-26 16:55:25,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:25,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:25,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:25,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:25,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1004376351, now seen corresponding path program 1 times [2025-04-26 16:55:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059151264] [2025-04-26 16:55:25,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:25,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:25,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:25,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:25,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,390 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:25,391 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:25,391 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:25,391 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:25,391 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:25,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:25,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:25,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:25,392 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:25,392 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:25,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,556 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:25,562 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:25,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,579 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:25,580 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:25,582 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:25,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,608 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,615 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:25,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,619 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:25,621 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:25,623 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:25,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:25,660 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:55:25,660 INFO L437 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:55:25,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,679 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:25,686 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:25,686 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:25,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:25,705 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:25,705 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:25,706 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:25,713 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:25,716 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:25,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:25,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:25,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:25,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,764 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,788 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:25,805 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:25,806 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 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.6666666666666665) internal successors, (in total 8), 3 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:25,906 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 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.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 424 states and 772 transitions. Complement of second has 7 states. [2025-04-26 16:55:25,907 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:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-26 16:55:25,917 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:55:25,917 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,917 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:55:25,918 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,918 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:55:25,918 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424 states and 772 transitions. [2025-04-26 16:55:25,925 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 16:55:25,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424 states to 209 states and 374 transitions. [2025-04-26 16:55:25,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-04-26 16:55:25,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-04-26 16:55:25,931 INFO L74 IsDeterministic]: Start isDeterministic. Operand 209 states and 374 transitions. [2025-04-26 16:55:25,932 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:25,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 374 transitions. [2025-04-26 16:55:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 374 transitions. [2025-04-26 16:55:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 183. [2025-04-26 16:55:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 183 states have (on average 1.7978142076502732) internal successors, (in total 329), 182 states have internal predecessors, (329), 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:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 329 transitions. [2025-04-26 16:55:25,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 183 states and 329 transitions. [2025-04-26 16:55:25,959 INFO L438 stractBuchiCegarLoop]: Abstraction has 183 states and 329 transitions. [2025-04-26 16:55:25,959 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:25,959 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 329 transitions. [2025-04-26 16:55:25,960 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 16:55:25,960 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:25,960 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:25,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:25,961 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:25,961 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L49: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[49] L49-->L50: 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[]" "[45] L50-->L51: 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[]" "[40] L51-->L52: 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[]" "[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L21-->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[]" "[87] L52-1-->L30: 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:25,961 INFO L754 eck$LassoCheckResult]: Loop: "[73] L30-->L31: 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[]" "[75] L31-->L32: Formula: (= (+ (select v_A_2 v_j_2) v_res2_2) v_res2_1) InVars {A=v_A_2, res2=v_res2_2, j=v_j_2} OutVars{A=v_A_2, res2=v_res2_1, j=v_j_2} AuxVars[] AssignedVars[res2]" "[76] L32-->L30: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 16:55:25,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1004377327, now seen corresponding path program 1 times [2025-04-26 16:55:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544222104] [2025-04-26 16:55:25,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:25,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:25,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:25,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:25,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-04-26 16:55:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620156080] [2025-04-26 16:55:25,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:25,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:25,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:25,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:25,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1632275129, now seen corresponding path program 1 times [2025-04-26 16:55:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485719567] [2025-04-26 16:55:25,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:26,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:26,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,087 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:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:26,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485719567] [2025-04-26 16:55:26,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485719567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:26,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:26,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:55:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392117604] [2025-04-26 16:55:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:26,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:26,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:26,114 INFO L87 Difference]: Start difference. First operand 183 states and 329 transitions. cyclomatic complexity: 173 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:26,203 INFO L93 Difference]: Finished difference Result 200 states and 349 transitions. [2025-04-26 16:55:26,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 349 transitions. [2025-04-26 16:55:26,205 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 81 [2025-04-26 16:55:26,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 200 states and 349 transitions. [2025-04-26 16:55:26,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-04-26 16:55:26,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-04-26 16:55:26,211 INFO L74 IsDeterministic]: Start isDeterministic. Operand 200 states and 349 transitions. [2025-04-26 16:55:26,211 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:26,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 200 states and 349 transitions. [2025-04-26 16:55:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 349 transitions. [2025-04-26 16:55:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2025-04-26 16:55:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.7849462365591398) internal successors, (in total 332), 185 states have internal predecessors, (332), 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:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 332 transitions. [2025-04-26 16:55:26,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 332 transitions. [2025-04-26 16:55:26,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:55:26,219 INFO L438 stractBuchiCegarLoop]: Abstraction has 186 states and 332 transitions. [2025-04-26 16:55:26,219 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:26,219 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 332 transitions. [2025-04-26 16:55:26,220 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 16:55:26,220 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:26,220 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:26,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:26,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:26,221 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L49: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[49] L49-->L50: 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[]" "[45] L50-->L51: 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[]" "[40] L51-->L52: 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[]" "[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L21-->L22: 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] L22-->L23: Formula: (= (+ v_res1_2 (select v_A_1 v_i_2)) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1} AuxVars[] AssignedVars[res1]" "[87] L52-1-->L30: 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]" "[71] L23-->L21: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[67] L21-->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:26,221 INFO L754 eck$LassoCheckResult]: Loop: "[73] L30-->L31: 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[]" "[75] L31-->L32: Formula: (= (+ (select v_A_2 v_j_2) v_res2_2) v_res2_1) InVars {A=v_A_2, res2=v_res2_2, j=v_j_2} OutVars{A=v_A_2, res2=v_res2_1, j=v_j_2} AuxVars[] AssignedVars[res2]" "[76] L32-->L30: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 16:55:26,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1161985933, now seen corresponding path program 1 times [2025-04-26 16:55:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266192626] [2025-04-26 16:55:26,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:26,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:26,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:26,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:26,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:26,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:26,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 2 times [2025-04-26 16:55:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505998862] [2025-04-26 16:55:26,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:26,244 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:26,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:26,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:26,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:26,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:26,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:26,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash -713403203, now seen corresponding path program 1 times [2025-04-26 16:55:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130181485] [2025-04-26 16:55:26,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:26,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:26,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:26,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:26,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:26,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:26,383 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:26,383 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:26,383 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:26,383 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:26,383 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:26,383 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,383 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:26,383 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:26,383 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:55:26,383 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:26,383 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:26,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,511 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:26,511 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:26,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,514 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:26,516 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:26,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,533 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:55:26,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,541 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:26,542 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:26,544 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:26,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,559 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,565 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:26,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,567 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:26,576 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:26,576 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:26,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,594 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,602 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:26,604 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:26,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:26,634 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:26,634 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:26,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,636 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:26,638 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:26,639 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:26,657 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:26,658 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:26,658 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:26,658 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:55:26,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,665 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:26,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:26,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:26,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:26,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,704 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,724 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:26,724 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:26,724 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 186 states and 332 transitions. cyclomatic complexity: 173 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:26,771 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 186 states and 332 transitions. cyclomatic complexity: 173. 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 399 states and 756 transitions. Complement of second has 6 states. [2025-04-26 16:55:26,771 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:26,772 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:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 16:55:26,772 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:55:26,772 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,772 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:55:26,772 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,772 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:55:26,773 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 756 transitions. [2025-04-26 16:55:26,775 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:55:26,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 243 states and 435 transitions. [2025-04-26 16:55:26,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2025-04-26 16:55:26,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 16:55:26,777 INFO L74 IsDeterministic]: Start isDeterministic. Operand 243 states and 435 transitions. [2025-04-26 16:55:26,778 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:26,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 243 states and 435 transitions. [2025-04-26 16:55:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 435 transitions. [2025-04-26 16:55:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 207. [2025-04-26 16:55:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 207 states have (on average 1.8502415458937198) internal successors, (in total 383), 206 states have internal predecessors, (383), 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:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 383 transitions. [2025-04-26 16:55:26,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 207 states and 383 transitions. [2025-04-26 16:55:26,786 INFO L438 stractBuchiCegarLoop]: Abstraction has 207 states and 383 transitions. [2025-04-26 16:55:26,786 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:26,786 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 383 transitions. [2025-04-26 16:55:26,787 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:55:26,787 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:26,787 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:26,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:26,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:26,788 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L49: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[49] L49-->L50: 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[]" "[45] L50-->L51: 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[]" "[40] L51-->L52: 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[]" "[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L21-->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[]" "[87] L52-1-->L30: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[72] L30-->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[]" "[74] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] L53-->L39: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:55:26,788 INFO L754 eck$LassoCheckResult]: Loop: "[78] L39-->L40: 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[]" "[80] L40-->L41: Formula: (= (+ (select v_A_3 v_k_3) v_res2_6) v_res2_5) InVars {A=v_A_3, res2=v_res2_6, k=v_k_3} OutVars{A=v_A_3, res2=v_res2_5, k=v_k_3} AuxVars[] AssignedVars[res2]" "[81] L41-->L39: Formula: (= v_k_4 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_4} AuxVars[] AssignedVars[k]" [2025-04-26 16:55:26,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1632274151, now seen corresponding path program 1 times [2025-04-26 16:55:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759740560] [2025-04-26 16:55:26,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:26,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:26,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:26,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:26,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:26,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:26,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2025-04-26 16:55:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046915531] [2025-04-26 16:55:26,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:26,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:26,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:26,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:26,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:26,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:26,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,814 INFO L85 PathProgramCache]: Analyzing trace with hash -540415352, now seen corresponding path program 1 times [2025-04-26 16:55:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320988005] [2025-04-26 16:55:26,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:26,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:26,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,888 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:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:26,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320988005] [2025-04-26 16:55:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320988005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:55:26,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351285605] [2025-04-26 16:55:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:26,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:26,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:26,904 INFO L87 Difference]: Start difference. First operand 207 states and 383 transitions. cyclomatic complexity: 195 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:26,970 INFO L93 Difference]: Finished difference Result 215 states and 391 transitions. [2025-04-26 16:55:26,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 391 transitions. [2025-04-26 16:55:26,973 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:55:26,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 209 states and 385 transitions. [2025-04-26 16:55:26,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-04-26 16:55:26,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 16:55:26,975 INFO L74 IsDeterministic]: Start isDeterministic. Operand 209 states and 385 transitions. [2025-04-26 16:55:26,975 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:26,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 385 transitions. [2025-04-26 16:55:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 385 transitions. [2025-04-26 16:55:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2025-04-26 16:55:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 206 states have (on average 1.8495145631067962) internal successors, (in total 381), 205 states have internal predecessors, (381), 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:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 381 transitions. [2025-04-26 16:55:26,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206 states and 381 transitions. [2025-04-26 16:55:26,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:55:26,983 INFO L438 stractBuchiCegarLoop]: Abstraction has 206 states and 381 transitions. [2025-04-26 16:55:26,983 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:26,983 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 381 transitions. [2025-04-26 16:55:26,984 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:55:26,984 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:26,984 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:26,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:26,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:26,985 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L49: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[49] L49-->L50: 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[]" "[45] L50-->L51: 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[]" "[40] L51-->L52: 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[]" "[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L21-->L22: 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] L22-->L23: Formula: (= (+ v_res1_2 (select v_A_1 v_i_2)) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1} AuxVars[] AssignedVars[res1]" "[87] L52-1-->L30: 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]" "[71] L23-->L21: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[67] L21-->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[]" "[72] L30-->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[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[74] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] L53-->L39: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:55:26,985 INFO L754 eck$LassoCheckResult]: Loop: "[78] L39-->L40: 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[]" "[80] L40-->L41: Formula: (= (+ (select v_A_3 v_k_3) v_res2_6) v_res2_5) InVars {A=v_A_3, res2=v_res2_6, k=v_k_3} OutVars{A=v_A_3, res2=v_res2_5, k=v_k_3} AuxVars[] AssignedVars[res2]" "[81] L41-->L39: Formula: (= v_k_4 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_4} AuxVars[] AssignedVars[k]" [2025-04-26 16:55:26,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash -640698342, now seen corresponding path program 1 times [2025-04-26 16:55:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848190964] [2025-04-26 16:55:26,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:27,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:27,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:27,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:27,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:27,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:27,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 2 times [2025-04-26 16:55:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:27,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224189014] [2025-04-26 16:55:27,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:27,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:27,008 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:27,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:27,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:27,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:27,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:27,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:27,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -209565579, now seen corresponding path program 1 times [2025-04-26 16:55:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:27,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260090387] [2025-04-26 16:55:27,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:27,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:55:27,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:55:27,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:27,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:55:27,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:55:27,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:27,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:27,152 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:27,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:27,153 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:27,153 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:27,153 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:27,153 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,153 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:27,153 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:27,153 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:27,153 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:27,153 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:27,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:27,292 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:27,292 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:27,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,294 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:27,297 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:27,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,311 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,316 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:27,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,318 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:27,320 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:27,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,335 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:55:27,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,343 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:27,345 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:27,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,372 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,378 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:27,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,380 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:27,382 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:27,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,397 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:55:27,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,405 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:27,405 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:27,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,423 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:55:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,430 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:27,432 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:27,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,448 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,454 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:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,456 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:27,460 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:27,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,478 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:27,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:27,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,489 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:27,490 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:27,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:27,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:27,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:27,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:27,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:27,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:27,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:27,509 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:27,518 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:27,518 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:27,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:27,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:27,521 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:27,529 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:27,529 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:27,547 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:27,547 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:27,547 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:27,547 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:55:27,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:55:27,577 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:27,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:27,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:27,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:27,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:27,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:27,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:27,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:27,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:27,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:27,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:27,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:27,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:27,639 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:27,640 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:27,640 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 206 states and 381 transitions. cyclomatic complexity: 194 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:27,678 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 206 states and 381 transitions. cyclomatic complexity: 194. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 450 states and 830 transitions. Complement of second has 6 states. [2025-04-26 16:55:27,678 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:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 16:55:27,679 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:55:27,679 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:27,679 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 16:55:27,679 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:27,679 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 16:55:27,679 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:27,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 830 transitions. [2025-04-26 16:55:27,683 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:27,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 0 states and 0 transitions. [2025-04-26 16:55:27,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:27,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:27,683 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:27,683 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:27,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:27,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:27,683 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:27,683 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:27,683 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:27,683 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:27,683 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:27,694 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:27,695 INFO L201 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:27 BoogieIcfgContainer [2025-04-26 16:55:27,695 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:27,696 INFO L158 Benchmark]: Toolchain (without parser) took 3233.36ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 83.4MB in the beginning and 73.2MB in the end (delta: 10.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:27,696 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.87ms. Allocated memory is still 155.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:27,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.27ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:27,697 INFO L158 Benchmark]: Boogie Preprocessor took 28.59ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 80.5MB in the end (delta: 961.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:27,697 INFO L158 Benchmark]: RCFGBuilder took 210.73ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 71.2MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:27,697 INFO L158 Benchmark]: BuchiAutomizer took 2950.53ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 71.1MB in the beginning and 73.2MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:27,698 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.87ms. Allocated memory is still 155.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.27ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.59ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 80.5MB in the end (delta: 961.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 210.73ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 71.2MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2950.53ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 71.1MB in the beginning and 73.2MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. 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, 79 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, 238 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 104 mSDtfsCounter, 202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital56 mio100 ax100 hnf100 lsp67 ukn96 mio100 lsp61 div100 bol100 ite100 ukn100 eq182 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms 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]: 204, Number of transitions in reduction automaton: 346, Number of states in reduction automaton: 195, 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:27,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...