/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:02,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:02,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:02,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:02,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:02,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:02,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:02,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:02,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:02,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:02,870 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:02,871 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:02,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:02,871 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:02,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:02,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:02,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:02,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:02,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:02,872 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:02,872 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:03,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:03,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:03,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:03,108 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:03,108 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:03,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum.wvr.bpl [2025-04-26 16:23:03,109 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum.wvr.bpl' [2025-04-26 16:23:03,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:03,127 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:03,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:03,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:03,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:03,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,163 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:03,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:03,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:03,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:03,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:03,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:03,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:03,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:03,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:03,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/1) ... [2025-04-26 16:23:03,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:03,213 INFO L229 MonitoredProcess]: Starting monitored process 1 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:23:03,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:03,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:03,239 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:03,239 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:03,239 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:03,240 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:23:03,277 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:03,278 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:03,363 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:03,363 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:03,372 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:03,373 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:03,374 INFO L201 PluginConnector]: Adding new model array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:03 BoogieIcfgContainer [2025-04-26 16:23:03,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:03,375 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:03,375 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:03,381 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:03,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:03,381 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:03" (1/2) ... [2025-04-26 16:23:03,382 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@133eca11 and model type array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:03, skipping insertion in model container [2025-04-26 16:23:03,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:03,382 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:03" (2/2) ... [2025-04-26 16:23:03,383 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum.wvr.bpl [2025-04-26 16:23:03,431 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:03,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:23:03,486 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 16:23:03,490 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:03,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:23:03,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:23:03,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 16:23:03,499 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 16:23:03,507 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:03,507 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:03,507 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:03,507 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:03,507 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:03,507 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:03,507 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:03,508 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:03,509 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:03,587 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 16:23:03,587 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:03,587 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:03,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:03,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:03,592 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:03,592 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 194 states, but on-demand construction may add more states [2025-04-26 16:23:03,601 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 16:23:03,601 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:03,601 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:03,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:03,602 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:03,609 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L50: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L50-->L51: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L51-->L52: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:03,609 INFO L754 eck$LassoCheckResult]: Loop: "[68] L22-->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[]" "[70] L23-->L24: Formula: (= (+ (select v_B_1 v_i_2) v_res1_2 (select v_A_1 v_i_2)) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2, B=v_B_1} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[71] L24-->L22: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:03,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash 87299277, now seen corresponding path program 1 times [2025-04-26 16:23:03,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424212560] [2025-04-26 16:23:03,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:03,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:03,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:03,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:03,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash 97380, now seen corresponding path program 1 times [2025-04-26 16:23:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515816452] [2025-04-26 16:23:03,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:03,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:03,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:03,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2017352680, now seen corresponding path program 1 times [2025-04-26 16:23:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210082955] [2025-04-26 16:23:03,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:03,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:03,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:03,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:03,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,859 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:03,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:03,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:03,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:03,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:03,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:03,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:03,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:03,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:03,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:03,862 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:03,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,036 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:04,039 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:04,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,042 INFO L229 MonitoredProcess]: Starting monitored process 2 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:23:04,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:04,045 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:23:04,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,082 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:04,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,091 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:23:04,093 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:23:04,094 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:23:04,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,115 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:23:04,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,123 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:23:04,125 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:23:04,126 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:23:04,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:04,170 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:04,171 INFO L437 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,175 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:23:04,176 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:23:04,176 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:04,193 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:23:04,193 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:04,194 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:04,194 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:23:04,200 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:23:04,202 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:04,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:04,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:04,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:04,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:04,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,319 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:23:04,351 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:23:04,353 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 194 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:04,459 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 194 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 503 states and 1618 transitions. Complement of second has 7 states. [2025-04-26 16:23:04,461 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:23:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-26 16:23:04,469 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:23:04,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:23:04,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:23:04,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 1618 transitions. [2025-04-26 16:23:04,482 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 144 [2025-04-26 16:23:04,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 349 states and 1134 transitions. [2025-04-26 16:23:04,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2025-04-26 16:23:04,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2025-04-26 16:23:04,494 INFO L74 IsDeterministic]: Start isDeterministic. Operand 349 states and 1134 transitions. [2025-04-26 16:23:04,495 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:04,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 349 states and 1134 transitions. [2025-04-26 16:23:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 1134 transitions. [2025-04-26 16:23:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 271. [2025-04-26 16:23:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 271 states have (on average 3.225092250922509) internal successors, (in total 874), 270 states have internal predecessors, (874), 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:23:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 874 transitions. [2025-04-26 16:23:04,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 874 transitions. [2025-04-26 16:23:04,531 INFO L438 stractBuchiCegarLoop]: Abstraction has 271 states and 874 transitions. [2025-04-26 16:23:04,532 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:04,532 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 874 transitions. [2025-04-26 16:23:04,534 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 144 [2025-04-26 16:23:04,534 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:04,535 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:04,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:04,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:04,535 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L50: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L50-->L51: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L51-->L52: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L53-1-->L31: 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:23:04,535 INFO L754 eck$LassoCheckResult]: Loop: "[73] L31-->L32: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[75] L32-->L33: Formula: (= (+ (select v_B_2 v_j_2) (select v_A_2 v_j_2) v_res2_2) v_res2_1) InVars {A=v_A_2, res2=v_res2_2, j=v_j_2, B=v_B_2} OutVars{A=v_A_2, res2=v_res2_1, j=v_j_2, B=v_B_2} AuxVars[] AssignedVars[res2]" "[76] L33-->L31: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 16:23:04,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1588689622, now seen corresponding path program 1 times [2025-04-26 16:23:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:04,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112506670] [2025-04-26 16:23:04,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:04,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:04,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:04,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:04,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:04,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:04,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:04,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-04-26 16:23:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:04,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550363139] [2025-04-26 16:23:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:04,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:04,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:04,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:04,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:04,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:04,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:04,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1887145472, now seen corresponding path program 1 times [2025-04-26 16:23:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:04,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792964764] [2025-04-26 16:23:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:04,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:04,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:04,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:04,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:04,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:04,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:04,664 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:04,664 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:04,664 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:04,664 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:04,664 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:04,664 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,664 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:04,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:04,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:04,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:04,664 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:04,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,767 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:04,767 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:04,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,770 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:23:04,772 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:23:04,772 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:23:04,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:04,800 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:04,800 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:23:04,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,802 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:23:04,805 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:23:04,806 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:04,829 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:23:04,829 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:04,829 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:04,829 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:23:04,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:04,837 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:04,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:04,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:04,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:04,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:04,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,891 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:23:04,892 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:23:04,892 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 874 transitions. cyclomatic complexity: 648 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:23:04,934 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 874 transitions. cyclomatic complexity: 648. 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 757 states and 2636 transitions. Complement of second has 6 states. [2025-04-26 16:23:04,934 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:23:04,935 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:23:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 16:23:04,935 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:23:04,935 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,935 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:23:04,935 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,935 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:23:04,935 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 2636 transitions. [2025-04-26 16:23:04,944 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2025-04-26 16:23:04,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 470 states and 1630 transitions. [2025-04-26 16:23:04,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2025-04-26 16:23:04,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2025-04-26 16:23:04,951 INFO L74 IsDeterministic]: Start isDeterministic. Operand 470 states and 1630 transitions. [2025-04-26 16:23:04,951 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:04,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 470 states and 1630 transitions. [2025-04-26 16:23:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states and 1630 transitions. [2025-04-26 16:23:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 402. [2025-04-26 16:23:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 402 states have (on average 3.5248756218905473) internal successors, (in total 1417), 401 states have internal predecessors, (1417), 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:23:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1417 transitions. [2025-04-26 16:23:04,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 402 states and 1417 transitions. [2025-04-26 16:23:04,966 INFO L438 stractBuchiCegarLoop]: Abstraction has 402 states and 1417 transitions. [2025-04-26 16:23:04,966 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:04,966 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 402 states and 1417 transitions. [2025-04-26 16:23:04,968 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2025-04-26 16:23:04,969 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:04,969 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:04,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:04,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:04,969 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L50: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L50-->L51: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L51-->L52: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L53-1-->L31: 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]" "[90] L54-->L40: 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:23:04,969 INFO L754 eck$LassoCheckResult]: Loop: "[78] L40-->L41: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L41-->L42: Formula: (= (+ (select v_A_3 v_k_3) v_res2_6 (select v_B_3 v_k_3)) v_res2_5) InVars {A=v_A_3, res2=v_res2_6, k=v_k_3, B=v_B_3} OutVars{A=v_A_3, res2=v_res2_5, k=v_k_3, B=v_B_3} AuxVars[] AssignedVars[res2]" "[81] L42-->L40: Formula: (= v_k_4 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_4} AuxVars[] AssignedVars[k]" [2025-04-26 16:23:04,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2004737936, now seen corresponding path program 1 times [2025-04-26 16:23:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:04,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933351820] [2025-04-26 16:23:04,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:04,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:04,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:04,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:04,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:04,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:04,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:04,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2025-04-26 16:23:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:04,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493080912] [2025-04-26 16:23:04,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:04,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:04,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:04,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:04,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:04,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:04,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1627522977, now seen corresponding path program 1 times [2025-04-26 16:23:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:04,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153096224] [2025-04-26 16:23:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:04,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:05,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:05,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:05,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:05,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:05,122 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:05,122 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:05,122 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:05,122 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:05,122 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:05,122 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,122 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:05,122 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:05,122 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:05,122 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:05,122 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:05,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,285 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:05,286 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:05,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,290 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:23:05,291 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:23:05,292 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:23:05,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,307 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:05,314 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:23:05,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,316 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:23:05,318 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:23:05,319 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:23:05,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,336 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:05,342 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:23:05,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,348 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:23:05,349 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:23:05,350 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:23:05,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,365 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:05,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:23:05,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,372 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:23:05,373 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:23:05,374 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:23:05,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:05,397 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:23:05,398 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:23:05,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,400 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:05,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:05,401 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:05,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:05,419 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:05,419 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:05,419 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:23:05,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:23:05,426 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:05,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:05,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:05,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:05,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:05,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:05,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:05,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:05,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:05,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:05,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,482 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:23:05,482 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:23:05,482 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 402 states and 1417 transitions. cyclomatic complexity: 1070 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:23:05,550 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 402 states and 1417 transitions. cyclomatic complexity: 1070. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 1056 states and 3770 transitions. Complement of second has 6 states. [2025-04-26 16:23:05,550 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:23:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:23:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 16:23:05,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:23:05,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:23:05,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 16:23:05,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1056 states and 3770 transitions. [2025-04-26 16:23:05,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:05,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1056 states to 0 states and 0 transitions. [2025-04-26 16:23:05,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:05,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:05,564 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:05,564 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:05,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:05,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:05,564 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:05,564 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:05,564 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:05,564 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:05,564 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:05,570 INFO L201 PluginConnector]: Adding new model array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:05 BoogieIcfgContainer [2025-04-26 16:23:05,570 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:05,571 INFO L158 Benchmark]: Toolchain (without parser) took 2444.23ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 82.0MB in the beginning and 54.1MB in the end (delta: 27.9MB). Peak memory consumption was 4.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:05,571 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:05,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 80.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:05,572 INFO L158 Benchmark]: Boogie Preprocessor took 23.36ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 79.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:05,572 INFO L158 Benchmark]: RCFGBuilder took 185.27ms. Allocated memory is still 155.2MB. Free memory was 79.1MB in the beginning and 69.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:05,573 INFO L158 Benchmark]: BuchiAutomizer took 2195.72ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 69.6MB in the beginning and 54.1MB in the end (delta: 15.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:05,573 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.15ms. Allocated memory is still 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 80.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.36ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 79.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 185.27ms. Allocated memory is still 155.2MB. Free memory was 79.1MB in the beginning and 69.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2195.72ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 69.6MB in the beginning and 54.1MB in the end (delta: 15.5MB). 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.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 146 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 83 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp70 ukn89 mio100 lsp73 div100 bol100 ite100 ukn100 eq150 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:05,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...