/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 18:40:55,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:55,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:55,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:55,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:55,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:55,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:55,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:55,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:55,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:55,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:55,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:55,520 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:55,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:55,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:55,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:55,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:55,521 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:55,521 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:55,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:55,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:55,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:55,751 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:55,751 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:55,752 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 18:40:55,753 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 18:40:55,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:55,766 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:55,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:55,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:55,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:55,773 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,790 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,795 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:55,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:55,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:55,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:55,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:55,803 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,803 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,805 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,805 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,807 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,807 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,809 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,809 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,809 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:55,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:55,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:55,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:55,822 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 06:40:55" (1/1) ... [2025-04-26 18:40:55,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:55,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,849 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 18:40:55,854 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 18:40:55,871 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:55,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:55,872 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:55,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:55,872 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:55,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:55,872 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:55,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:55,872 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 18:40:55,906 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:55,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:55,967 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:55,967 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:55,974 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:55,975 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:55,975 INFO L201 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:55 BoogieIcfgContainer [2025-04-26 18:40:55,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:55,976 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:55,976 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:55,979 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:55,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:55,980 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 06:40:55" (1/2) ... [2025-04-26 18:40:55,981 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b595436 and model type array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:55, skipping insertion in model container [2025-04-26 18:40:55,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:55,981 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 06:40:55" (2/2) ... [2025-04-26 18:40:55,982 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-alt.wvr.bpl [2025-04-26 18:40:56,025 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:56,062 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:56,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:56,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,064 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 18:40:56,066 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 18:40:56,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:40:56,135 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 18:40:56,137 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:56,139 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 18:40:56,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:40:56,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 18:40:56,142 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 18:40:56,142 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2025-04-26 18:40:56,163 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 195 states, 193 states have (on average 2.8756476683937824) internal successors, (in total 555), 194 states have internal predecessors, (555), 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 18:40:56,164 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 195 states, 193 states have (on average 2.8756476683937824) internal successors, (in total 555), 194 states have internal predecessors, (555), 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 18:40:56,166 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:56,240 WARN L140 AmpleReduction]: Number of pruned transitions: 209 [2025-04-26 18:40:56,240 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:56,240 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 52 [2025-04-26 18:40:56,240 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 18:40:56,240 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:116 [2025-04-26 18:40:56,240 WARN L145 AmpleReduction]: Times succ was already a loop node:17 [2025-04-26 18:40:56,240 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:88 [2025-04-26 18:40:56,240 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:56,241 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 18:40:56,264 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:56,264 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:56,266 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:56,266 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:56,266 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:56,266 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:56,266 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:56,266 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:56,268 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 18:40:56,283 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 18:40:56,283 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:56,283 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:56,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:56,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:56,287 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:56,287 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 18:40:56,291 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 18:40:56,291 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:56,291 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:56,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:56,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:56,295 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 18:40:56,295 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 18:40:56,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash 86468260, now seen corresponding path program 1 times [2025-04-26 18:40:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:56,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899848977] [2025-04-26 18:40:56,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:56,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:56,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:56,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:56,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:56,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:56,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:56,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:56,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:56,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 97380, now seen corresponding path program 1 times [2025-04-26 18:40:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:56,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839858596] [2025-04-26 18:40:56,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:56,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:56,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:56,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:56,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:56,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:56,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:56,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1004376351, now seen corresponding path program 1 times [2025-04-26 18:40:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:56,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489891756] [2025-04-26 18:40:56,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:56,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:56,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:56,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:56,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:56,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:56,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:56,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:56,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:56,556 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:56,556 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:56,556 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:56,557 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:56,557 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:56,557 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,557 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:56,557 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:56,557 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:56,557 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:56,557 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:56,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,732 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:56,734 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:56,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,738 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 18:40:56,739 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 18:40:56,742 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 18:40:56,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:56,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:56,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,781 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 18:40:56,782 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 18:40:56,783 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 18:40:56,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,804 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:56,816 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:40:56,817 INFO L437 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 18:40:56,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,840 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 18:40:56,842 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 18:40:56,843 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:56,861 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 18:40:56,862 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:56,862 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:56,862 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:40:56,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:40:56,872 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:56,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:56,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:56,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:56,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,948 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 18:40:56,964 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 18:40:56,965 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 18:40:57,062 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 18:40:57,064 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 18:40:57,067 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 18:40:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-26 18:40:57,074 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:40:57,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:57,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:40:57,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:57,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:40:57,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:57,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424 states and 772 transitions. [2025-04-26 18:40:57,081 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:57,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424 states to 209 states and 374 transitions. [2025-04-26 18:40:57,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-04-26 18:40:57,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-04-26 18:40:57,090 INFO L74 IsDeterministic]: Start isDeterministic. Operand 209 states and 374 transitions. [2025-04-26 18:40:57,091 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:57,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 374 transitions. [2025-04-26 18:40:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 374 transitions. [2025-04-26 18:40:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 183. [2025-04-26 18:40:57,113 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 18:40:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 329 transitions. [2025-04-26 18:40:57,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 183 states and 329 transitions. [2025-04-26 18:40:57,114 INFO L438 stractBuchiCegarLoop]: Abstraction has 183 states and 329 transitions. [2025-04-26 18:40:57,115 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:57,115 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 329 transitions. [2025-04-26 18:40:57,116 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:57,116 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:57,116 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:57,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:57,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:57,117 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 18:40:57,117 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 18:40:57,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1004377327, now seen corresponding path program 1 times [2025-04-26 18:40:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616542050] [2025-04-26 18:40:57,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:57,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:57,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:57,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:57,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:57,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:57,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-04-26 18:40:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446602867] [2025-04-26 18:40:57,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:57,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:57,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:57,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:57,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:57,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:57,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1632275129, now seen corresponding path program 1 times [2025-04-26 18:40:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118364161] [2025-04-26 18:40:57,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:57,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:57,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:57,213 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 18:40:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:57,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118364161] [2025-04-26 18:40:57,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118364161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:57,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:57,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:40:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358816910] [2025-04-26 18:40:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:57,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:40:57,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:40:57,235 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 18:40:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:57,310 INFO L93 Difference]: Finished difference Result 200 states and 349 transitions. [2025-04-26 18:40:57,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 349 transitions. [2025-04-26 18:40:57,311 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 81 [2025-04-26 18:40:57,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 200 states and 349 transitions. [2025-04-26 18:40:57,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-04-26 18:40:57,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-04-26 18:40:57,313 INFO L74 IsDeterministic]: Start isDeterministic. Operand 200 states and 349 transitions. [2025-04-26 18:40:57,313 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:57,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 200 states and 349 transitions. [2025-04-26 18:40:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 349 transitions. [2025-04-26 18:40:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2025-04-26 18:40:57,321 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 18:40:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 332 transitions. [2025-04-26 18:40:57,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 332 transitions. [2025-04-26 18:40:57,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:40:57,326 INFO L438 stractBuchiCegarLoop]: Abstraction has 186 states and 332 transitions. [2025-04-26 18:40:57,326 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:57,326 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 332 transitions. [2025-04-26 18:40:57,327 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:57,327 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:57,327 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:57,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:57,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:57,328 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 18:40:57,328 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 18:40:57,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1161985933, now seen corresponding path program 1 times [2025-04-26 18:40:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96800394] [2025-04-26 18:40:57,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:57,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:57,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:57,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:57,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:57,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:57,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 2 times [2025-04-26 18:40:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550003285] [2025-04-26 18:40:57,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:57,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:57,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:57,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:57,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:57,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:57,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash -713403203, now seen corresponding path program 1 times [2025-04-26 18:40:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890675024] [2025-04-26 18:40:57,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:57,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:57,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:57,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:57,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:57,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:57,503 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:57,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:57,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:57,503 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:57,503 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:57,503 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:57,503 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:57,503 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:57,503 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:57,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:57,504 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:57,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:57,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:57,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:57,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:57,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:57,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:57,622 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:57,622 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:57,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:57,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:57,624 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 18:40:57,625 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 18:40:57,626 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 18:40:57,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:57,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:57,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:57,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:57,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:57,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:57,643 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:57,648 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 18:40:57,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:57,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:57,657 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 18:40:57,658 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 18:40:57,659 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 18:40:57,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:57,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:57,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:57,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:57,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:57,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:57,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:57,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:40:57,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:57,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:57,680 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 18:40:57,682 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 18:40:57,683 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 18:40:57,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:57,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:57,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:57,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:57,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:57,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:57,701 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:57,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:40:57,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:57,708 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 18:40:57,709 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 18:40:57,710 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 18:40:57,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:57,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:57,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:57,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:57,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:57,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:57,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:57,737 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:40:57,737 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:40:57,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:57,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:57,739 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 18:40:57,741 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 18:40:57,743 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:57,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:40:57,763 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:57,763 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:57,764 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:40:57,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:40:57,771 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:57,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:57,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:57,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:57,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:57,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:57,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:57,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:57,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:57,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:57,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:57,844 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 18:40:57,845 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 18:40:57,845 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 18:40:57,889 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 18:40:57,890 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 18:40:57,892 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 18:40:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:40:57,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:40:57,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:57,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:40:57,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:57,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 18:40:57,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:57,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 756 transitions. [2025-04-26 18:40:57,896 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:57,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 243 states and 435 transitions. [2025-04-26 18:40:57,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2025-04-26 18:40:57,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 18:40:57,898 INFO L74 IsDeterministic]: Start isDeterministic. Operand 243 states and 435 transitions. [2025-04-26 18:40:57,898 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:57,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 243 states and 435 transitions. [2025-04-26 18:40:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 435 transitions. [2025-04-26 18:40:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 207. [2025-04-26 18:40:57,911 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 18:40:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 383 transitions. [2025-04-26 18:40:57,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 207 states and 383 transitions. [2025-04-26 18:40:57,912 INFO L438 stractBuchiCegarLoop]: Abstraction has 207 states and 383 transitions. [2025-04-26 18:40:57,912 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:57,912 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 383 transitions. [2025-04-26 18:40:57,913 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:57,913 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:57,913 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:57,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:57,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:57,917 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 18:40:57,917 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 18:40:57,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1632274151, now seen corresponding path program 1 times [2025-04-26 18:40:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425151981] [2025-04-26 18:40:57,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:57,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:57,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:57,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:57,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:57,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:57,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2025-04-26 18:40:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352079536] [2025-04-26 18:40:57,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:57,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:57,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:57,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:57,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:57,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:57,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:57,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash -540415352, now seen corresponding path program 1 times [2025-04-26 18:40:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:57,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917339266] [2025-04-26 18:40:57,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:57,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:57,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:57,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:57,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:57,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:58,004 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 18:40:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:58,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917339266] [2025-04-26 18:40:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917339266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:58,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:40:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22042893] [2025-04-26 18:40:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:58,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:40:58,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:40:58,017 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 18:40:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:58,084 INFO L93 Difference]: Finished difference Result 215 states and 391 transitions. [2025-04-26 18:40:58,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 391 transitions. [2025-04-26 18:40:58,085 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:58,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 209 states and 385 transitions. [2025-04-26 18:40:58,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-04-26 18:40:58,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 18:40:58,088 INFO L74 IsDeterministic]: Start isDeterministic. Operand 209 states and 385 transitions. [2025-04-26 18:40:58,088 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:58,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 385 transitions. [2025-04-26 18:40:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 385 transitions. [2025-04-26 18:40:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2025-04-26 18:40:58,097 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 18:40:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 381 transitions. [2025-04-26 18:40:58,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206 states and 381 transitions. [2025-04-26 18:40:58,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:40:58,098 INFO L438 stractBuchiCegarLoop]: Abstraction has 206 states and 381 transitions. [2025-04-26 18:40:58,098 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:58,098 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 381 transitions. [2025-04-26 18:40:58,099 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:58,099 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:58,099 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:58,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:58,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:58,100 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 18:40:58,100 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 18:40:58,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -640698342, now seen corresponding path program 1 times [2025-04-26 18:40:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:58,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717278760] [2025-04-26 18:40:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:58,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:58,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:58,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:58,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:58,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:58,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:58,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:58,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 2 times [2025-04-26 18:40:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:58,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379388791] [2025-04-26 18:40:58,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:58,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:58,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:58,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:58,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:58,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:58,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:58,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:58,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:58,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -209565579, now seen corresponding path program 1 times [2025-04-26 18:40:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:58,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100386718] [2025-04-26 18:40:58,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:58,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:40:58,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:40:58,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:58,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:58,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:58,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:40:58,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:40:58,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:58,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:58,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:58,263 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:58,264 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:58,264 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:58,264 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:58,264 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:58,264 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,264 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:58,264 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:58,264 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:40:58,264 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:58,264 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:58,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:58,388 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:58,388 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:58,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,390 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 18:40:58,391 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 18:40:58,392 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 18:40:58,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,405 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:58,411 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 18:40:58,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,413 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 18:40:58,414 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 18:40:58,415 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 18:40:58,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:58,435 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 18:40:58,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,437 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 18:40:58,438 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 18:40:58,439 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 18:40:58,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,454 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:58,459 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 18:40:58,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,462 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 18:40:58,463 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 18:40:58,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:58,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,478 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:58,484 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 18:40:58,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,486 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 18:40:58,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:40:58,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:58,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,502 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:58,507 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 18:40:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,510 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 18:40:58,511 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 18:40:58,513 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 18:40:58,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,527 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:58,533 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 18:40:58,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,535 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 18:40:58,537 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 18:40:58,538 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 18:40:58,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,556 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:58,562 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 18:40:58,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,566 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 18:40:58,568 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 18:40:58,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:58,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:58,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:58,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:58,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:58,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:58,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:58,585 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:58,592 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:58,592 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:40:58,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:58,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:58,595 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 18:40:58,596 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 18:40:58,598 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:58,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:58,616 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:58,616 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:58,616 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:40:58,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:58,651 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:58,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:58,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:58,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:58,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:58,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:58,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:58,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:58,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:58,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:58,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:58,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:58,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:58,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:58,704 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 18:40:58,705 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 18:40:58,705 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 18:40:58,731 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 18:40:58,731 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 18:40:58,732 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 18:40:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:40:58,732 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:40:58,732 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:58,732 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 18:40:58,732 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:58,732 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 18:40:58,732 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:58,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 830 transitions. [2025-04-26 18:40:58,752 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:58,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 0 states and 0 transitions. [2025-04-26 18:40:58,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:58,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:58,752 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:58,752 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:58,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:58,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:58,752 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:58,752 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:40:58,753 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:58,753 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:58,753 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:58,764 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 18:40:58,765 INFO L201 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:58 BoogieIcfgContainer [2025-04-26 18:40:58,765 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:58,766 INFO L158 Benchmark]: Toolchain (without parser) took 2999.03ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 86.5MB in the beginning and 108.9MB in the end (delta: -22.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:58,766 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:58,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 155.2MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:58,767 INFO L158 Benchmark]: Boogie Preprocessor took 21.80ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 83.7MB in the end (delta: 992.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:58,767 INFO L158 Benchmark]: RCFGBuilder took 154.35ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 74.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:58,768 INFO L158 Benchmark]: BuchiAutomizer took 2789.16ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 74.3MB in the beginning and 108.9MB in the end (delta: -34.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:58,769 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.17ms. Allocated memory is still 155.2MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 155.2MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.80ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 83.7MB in the end (delta: 992.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 154.35ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 74.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2789.16ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 74.3MB in the beginning and 108.9MB in the end (delta: -34.6MB). 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.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. 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.1s 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.1s 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: 35ms 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 183, 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 18:40:58,781 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...