/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/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:11,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:11,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:11,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:11,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:11,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:11,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:11,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:11,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:11,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:11,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:11,266 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:11,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:11,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:11,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:11,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:11,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:11,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:11,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:11,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:11,268 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:11,268 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:11,268 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:11,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:11,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:11,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:11,504 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:11,504 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:11,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2025-04-26 16:56:11,506 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2025-04-26 16:56:11,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:11,526 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:11,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:11,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:11,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:11,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,565 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:11,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:11,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:11,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:11,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:11,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:11,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:11,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:11,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:11,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/1) ... [2025-04-26 16:56:11,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:11,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:11,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:11,639 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:11,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:11,640 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:11,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:11,640 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:11,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:11,640 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:11,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:11,641 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:11,675 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:11,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:11,752 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:11,752 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:11,773 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:11,773 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:11,774 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:11 BoogieIcfgContainer [2025-04-26 16:56:11,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:11,775 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:11,775 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:11,780 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:11,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:11,781 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:11" (1/2) ... [2025-04-26 16:56:11,782 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ad16cfa and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:11, skipping insertion in model container [2025-04-26 16:56:11,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:11,782 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:11" (2/2) ... [2025-04-26 16:56:11,783 INFO L376 chiAutomizerObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2025-04-26 16:56:11,825 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:11,856 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:11,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:11,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:11,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:11,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 16:56:11,931 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-26 16:56:11,933 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:11,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-04-26 16:56:11,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 16:56:11,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2025-04-26 16:56:11,939 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 26 transitions, 70 flow [2025-04-26 16:56:11,946 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:12,047 WARN L140 AmpleReduction]: Number of pruned transitions: 117 [2025-04-26 16:56:12,047 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:12,047 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 40 [2025-04-26 16:56:12,047 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 16:56:12,047 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:66 [2025-04-26 16:56:12,048 WARN L145 AmpleReduction]: Times succ was already a loop node:76 [2025-04-26 16:56:12,048 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:19 [2025-04-26 16:56:12,048 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:12,050 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,056 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:12,056 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:12,056 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:12,056 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:12,056 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:12,056 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:12,056 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:12,057 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:12,058 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,072 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 16:56:12,072 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,072 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:12,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:12,075 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:12,076 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,079 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 16:56:12,079 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,079 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:12,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:12,083 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:12,083 INFO L754 eck$LassoCheckResult]: Loop: "[74] L23-1-->L23: 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[]" "[76] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_asum_5 (+ (select v_A_3 v_i_8) v_asum_6))) InVars {A=v_A_3, i=v_i_8, asum=v_asum_6} OutVars{A=v_A_3, i=v_i_7, asum=v_asum_5} AuxVars[] AssignedVars[i, asum]" [2025-04-26 16:56:12,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 94267, now seen corresponding path program 1 times [2025-04-26 16:56:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559071802] [2025-04-26 16:56:12,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2025-04-26 16:56:12,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640160995] [2025-04-26 16:56:12,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:12,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:12,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:12,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:12,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash 90592957, now seen corresponding path program 1 times [2025-04-26 16:56:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677461636] [2025-04-26 16:56:12,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:12,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:12,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:12,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,379 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:12,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:12,380 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:12,380 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:12,380 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:12,380 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,381 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:12,381 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:12,381 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:12,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:12,381 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:12,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,573 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:12,586 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:12,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:12,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,659 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:12,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:12,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:12,704 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:12,704 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:12,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:12,710 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:12,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:12,732 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:12,732 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:12,736 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:56:12,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:12,744 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:12,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:12,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:12,825 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:12,826 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,928 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 312 states and 655 transitions. Complement of second has 7 states. [2025-04-26 16:56:12,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-26 16:56:12,939 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:12,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,940 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:12,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,940 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:12,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 655 transitions. [2025-04-26 16:56:12,949 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:12,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 152 states and 314 transitions. [2025-04-26 16:56:12,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-04-26 16:56:12,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-04-26 16:56:12,955 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 314 transitions. [2025-04-26 16:56:12,955 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:12,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 314 transitions. [2025-04-26 16:56:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 314 transitions. [2025-04-26 16:56:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2025-04-26 16:56:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 2.125) internal successors, (in total 272), 127 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 272 transitions. [2025-04-26 16:56:12,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 272 transitions. [2025-04-26 16:56:12,976 INFO L438 stractBuchiCegarLoop]: Abstraction has 128 states and 272 transitions. [2025-04-26 16:56:12,976 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:12,976 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 272 transitions. [2025-04-26 16:56:12,977 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:12,977 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,977 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:12,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:12,978 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[75] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] L61-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:12,978 INFO L754 eck$LassoCheckResult]: Loop: "[78] L34-1-->L34: Formula: (< v_k_1 v_N_3) InVars {k=v_k_1, N=v_N_3} OutVars{k=v_k_1, N=v_N_3} AuxVars[] AssignedVars[]" "[80] L34-->L34-1: Formula: (and (= v_k_12 (+ v_k_13 1)) (= (store v_C_5 v_k_13 (+ (select v_A_5 v_k_13) 1)) v_C_4) (= v_k_12 v_p_7)) InVars {A=v_A_5, k=v_k_13, C=v_C_5} OutVars{A=v_A_5, p=v_p_7, k=v_k_12, C=v_C_4} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 16:56:12,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1486586529, now seen corresponding path program 1 times [2025-04-26 16:56:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54430052] [2025-04-26 16:56:12,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:12,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:12,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:12,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:12,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 16:56:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349679488] [2025-04-26 16:56:12,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1614457697, now seen corresponding path program 1 times [2025-04-26 16:56:13,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424766359] [2025-04-26 16:56:13,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:13,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:13,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:13,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424766359] [2025-04-26 16:56:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424766359] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:13,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:13,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510283395] [2025-04-26 16:56:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:13,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:13,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:13,097 INFO L87 Difference]: Start difference. First operand 128 states and 272 transitions. cyclomatic complexity: 171 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:13,157 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2025-04-26 16:56:13,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 294 transitions. [2025-04-26 16:56:13,158 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 57 [2025-04-26 16:56:13,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 294 transitions. [2025-04-26 16:56:13,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:56:13,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-04-26 16:56:13,163 INFO L74 IsDeterministic]: Start isDeterministic. Operand 144 states and 294 transitions. [2025-04-26 16:56:13,163 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:13,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 294 transitions. [2025-04-26 16:56:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 294 transitions. [2025-04-26 16:56:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2025-04-26 16:56:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 2.099236641221374) internal successors, (in total 275), 130 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 275 transitions. [2025-04-26 16:56:13,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 16:56:13,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:56:13,172 INFO L438 stractBuchiCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 16:56:13,172 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:13,172 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 275 transitions. [2025-04-26 16:56:13,173 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:13,173 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:13,173 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:13,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:13,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:13,174 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] L23-1-->L23: 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[]" "[92] L61-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_asum_5 (+ (select v_A_3 v_i_8) v_asum_6))) InVars {A=v_A_3, i=v_i_8, asum=v_asum_6} OutVars{A=v_A_3, i=v_i_7, asum=v_asum_5} AuxVars[] AssignedVars[i, asum]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,174 INFO L754 eck$LassoCheckResult]: Loop: "[78] L34-1-->L34: Formula: (< v_k_1 v_N_3) InVars {k=v_k_1, N=v_N_3} OutVars{k=v_k_1, N=v_N_3} AuxVars[] AssignedVars[]" "[80] L34-->L34-1: Formula: (and (= v_k_12 (+ v_k_13 1)) (= (store v_C_5 v_k_13 (+ (select v_A_5 v_k_13) 1)) v_C_4) (= v_k_12 v_p_7)) InVars {A=v_A_5, k=v_k_13, C=v_C_5} OutVars{A=v_A_5, p=v_p_7, k=v_k_12, C=v_C_4} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 16:56:13,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1160503562, now seen corresponding path program 1 times [2025-04-26 16:56:13,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761475356] [2025-04-26 16:56:13,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:13,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:13,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2025-04-26 16:56:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986119723] [2025-04-26 16:56:13,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:13,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1447571380, now seen corresponding path program 1 times [2025-04-26 16:56:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436552654] [2025-04-26 16:56:13,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:13,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:13,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:13,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:13,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,349 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:13,349 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:13,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:13,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:13,350 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:13,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:13,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:13,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:13,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:13,350 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:13,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,478 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:13,478 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:13,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:13,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:13,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,497 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:56:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,505 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:13,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:13,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:13,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:13,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:13,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,547 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:56:13,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:13,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:13,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,572 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:13,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:13,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:13,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:13,609 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:13,609 INFO L437 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:56:13,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:13,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:13,613 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:13,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:13,628 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:13,629 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:13,629 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:56:13,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:13,635 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:13,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:13,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:13,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:13,684 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:13,685 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 275 transitions. cyclomatic complexity: 171 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,750 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 275 transitions. cyclomatic complexity: 171. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 286 states and 607 transitions. Complement of second has 6 states. [2025-04-26 16:56:13,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 16:56:13,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:13,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:56:13,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:56:13,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 607 transitions. [2025-04-26 16:56:13,757 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:13,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 192 states and 397 transitions. [2025-04-26 16:56:13,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2025-04-26 16:56:13,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 16:56:13,759 INFO L74 IsDeterministic]: Start isDeterministic. Operand 192 states and 397 transitions. [2025-04-26 16:56:13,759 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:13,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 192 states and 397 transitions. [2025-04-26 16:56:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 397 transitions. [2025-04-26 16:56:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-04-26 16:56:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.1146496815286624) internal successors, (in total 332), 156 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 332 transitions. [2025-04-26 16:56:13,769 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 332 transitions. [2025-04-26 16:56:13,769 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 332 transitions. [2025-04-26 16:56:13,769 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:13,769 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 332 transitions. [2025-04-26 16:56:13,770 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:13,770 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:13,770 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:13,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:13,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:13,771 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[75] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] L61-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[77] L34-1-->thread2FINAL: Formula: (<= v_N_4 v_k_6) InVars {k=v_k_6, N=v_N_4} OutVars{k=v_k_6, N=v_N_4} AuxVars[] AssignedVars[]" "[79] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[95] L62-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:13,771 INFO L754 eck$LassoCheckResult]: Loop: "[82] L46-1-->L46: Formula: (< v_l_8 v_N_8) InVars {l=v_l_8, N=v_N_8} OutVars{l=v_l_8, N=v_N_8} AuxVars[] AssignedVars[]" "[85] L46-->L46-1: Formula: (<= v_p_4 v_l_6) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1491419842, now seen corresponding path program 1 times [2025-04-26 16:56:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47391573] [2025-04-26 16:56:13,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:13,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:13,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:13,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:13,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash 3588, now seen corresponding path program 1 times [2025-04-26 16:56:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374782610] [2025-04-26 16:56:13,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1264611329, now seen corresponding path program 1 times [2025-04-26 16:56:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588871900] [2025-04-26 16:56:13,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:13,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:13,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:13,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588871900] [2025-04-26 16:56:13,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588871900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:13,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:13,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:13,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979329389] [2025-04-26 16:56:13,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:13,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:13,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:13,839 INFO L87 Difference]: Start difference. First operand 157 states and 332 transitions. cyclomatic complexity: 203 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:13,888 INFO L93 Difference]: Finished difference Result 162 states and 337 transitions. [2025-04-26 16:56:13,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 337 transitions. [2025-04-26 16:56:13,889 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:13,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 156 states and 331 transitions. [2025-04-26 16:56:13,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-04-26 16:56:13,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2025-04-26 16:56:13,891 INFO L74 IsDeterministic]: Start isDeterministic. Operand 156 states and 331 transitions. [2025-04-26 16:56:13,891 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:13,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 331 transitions. [2025-04-26 16:56:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 331 transitions. [2025-04-26 16:56:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2025-04-26 16:56:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 2.1298701298701297) internal successors, (in total 328), 153 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 328 transitions. [2025-04-26 16:56:13,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 328 transitions. [2025-04-26 16:56:13,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:13,898 INFO L438 stractBuchiCegarLoop]: Abstraction has 154 states and 328 transitions. [2025-04-26 16:56:13,898 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:13,898 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 328 transitions. [2025-04-26 16:56:13,899 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:13,899 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:13,899 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:13,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:13,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:13,899 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] L23-1-->L23: 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[]" "[92] L61-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_asum_5 (+ (select v_A_3 v_i_8) v_asum_6))) InVars {A=v_A_3, i=v_i_8, asum=v_asum_6} OutVars{A=v_A_3, i=v_i_7, asum=v_asum_5} AuxVars[] AssignedVars[i, asum]" "[73] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[78] L34-1-->L34: Formula: (< v_k_1 v_N_3) InVars {k=v_k_1, N=v_N_3} OutVars{k=v_k_1, N=v_N_3} AuxVars[] AssignedVars[]" "[95] L62-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:13,899 INFO L754 eck$LassoCheckResult]: Loop: "[82] L46-1-->L46: Formula: (< v_l_8 v_N_8) InVars {l=v_l_8, N=v_N_8} OutVars{l=v_l_8, N=v_N_8} AuxVars[] AssignedVars[]" "[85] L46-->L46-1: Formula: (<= v_p_4 v_l_6) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1447571365, now seen corresponding path program 1 times [2025-04-26 16:56:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743458823] [2025-04-26 16:56:13,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:13,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:13,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:13,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 3588, now seen corresponding path program 2 times [2025-04-26 16:56:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462003549] [2025-04-26 16:56:13,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:13,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:13,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:13,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:13,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,922 INFO L85 PathProgramCache]: Analyzing trace with hash 453324766, now seen corresponding path program 1 times [2025-04-26 16:56:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875824425] [2025-04-26 16:56:13,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:13,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:13,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:13,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:13,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:14,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:14,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:14,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,089 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:14 BoogieIcfgContainer [2025-04-26 16:56:14,089 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:14,089 INFO L158 Benchmark]: Toolchain (without parser) took 2563.36ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.8MB in the beginning and 65.2MB in the end (delta: 20.7MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:14,090 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 200.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:14,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.48ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:14,090 INFO L158 Benchmark]: Boogie Preprocessor took 20.33ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.1MB in the end (delta: 854.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:14,090 INFO L158 Benchmark]: RCFGBuilder took 186.50ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:14,090 INFO L158 Benchmark]: BuchiAutomizer took 2313.58ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 65.2MB in the end (delta: 7.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:14,091 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 200.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.48ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.33ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.1MB in the end (delta: 854.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 186.50ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2313.58ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 65.2MB in the end (delta: 7.7MB). 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.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 74 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 51 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital53 mio100 ax100 hnf100 lsp65 ukn85 mio100 lsp70 div100 bol100 ite100 ukn100 eq173 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms VariablesStem: 1 VariablesLoop: 3 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]: 197, Number of transitions in reduction automaton: 265, Number of states in reduction automaton: 130, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 5 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 4 locations. The remainder module has 154 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 45]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; VAL [asum=0, csum=0, i=0, k=0, l=0, p=0] [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L22] COND TRUE 1 i < N VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L24] 1 asum := asum + A[i]; [L25] 1 i := i + 1; VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L22] COND FALSE 1 !(i < N) VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L33] COND TRUE 2 k < N VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; VAL [asum=0, csum=0, i=0, k=0, l=0, p=0] [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L22] COND TRUE 1 i < N VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L24] 1 asum := asum + A[i]; [L25] 1 i := i + 1; VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L22] COND FALSE 1 !(i < N) VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L33] COND TRUE 2 k < N VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:56:14,103 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...