/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/three-array-max.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:53,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:53,740 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:53,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:53,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:53,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:53,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:53,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:53,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:53,768 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:53,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:53,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:53,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:53,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:53,769 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:53,769 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:54,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:54,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:54,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:54,027 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:54,029 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:54,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-max.wvr.bpl [2025-04-26 16:23:54,032 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-max.wvr.bpl' [2025-04-26 16:23:54,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:54,055 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:54,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:54,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:54,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:54,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,093 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:54,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:54,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:54,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:54,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:54,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:54,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:54,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:54,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:54,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/1) ... [2025-04-26 16:23:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,156 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:54,158 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:54,182 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:54,182 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:54,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:54,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:54,183 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:54,218 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:54,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:54,326 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:54,327 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:54,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:54,345 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:54,345 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:54 BoogieIcfgContainer [2025-04-26 16:23:54,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:54,346 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:54,346 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:54,351 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:54,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:54,352 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:54" (1/2) ... [2025-04-26 16:23:54,353 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@128bda2f and model type three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:54, skipping insertion in model container [2025-04-26 16:23:54,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:54,354 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:54" (2/2) ... [2025-04-26 16:23:54,355 INFO L376 chiAutomizerObserver]: Analyzing ICFG three-array-max.wvr.bpl [2025-04-26 16:23:54,403 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:54,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 91 flow [2025-04-26 16:23:54,460 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 16:23:54,462 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:54,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-04-26 16:23:54,466 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 91 flow [2025-04-26 16:23:54,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-04-26 16:23:54,471 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 29 transitions, 76 flow [2025-04-26 16:23:54,479 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:54,479 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:54,479 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:54,479 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:54,479 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:54,479 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:54,479 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:54,479 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:54,481 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:54,527 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 105 [2025-04-26 16:23:54,527 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,527 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:54,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,530 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:54,530 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 135 states, but on-demand construction may add more states [2025-04-26 16:23:54,535 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 105 [2025-04-26 16:23:54,536 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,536 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:54,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,540 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_maxa_3 (select v_A_3 0)) InVars {A=v_A_3, maxa=v_maxa_3} OutVars{A=v_A_3, maxa=v_maxa_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_maxb_3) InVars {maxb=v_maxb_3, B=v_B_3} OutVars{maxb=v_maxb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_maxc_1) InVars {A=v_A_4, maxc=v_maxc_1, B=v_B_4} OutVars{A=v_A_4, maxc=v_maxc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:54,540 INFO L754 eck$LassoCheckResult]: Loop: "[82] L25-1-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L25-->L25-1: Formula: (and (= (let ((.cse0 (select v_B_7 v_i_13))) (ite (< .cse0 v_maxb_10) v_maxb_10 .cse0)) v_maxb_9) (= (let ((.cse1 (select v_A_5 v_i_13))) (ite (< .cse1 v_maxa_6) v_maxa_6 .cse1)) v_maxa_5) (= (+ v_i_13 1) v_i_12)) InVars {A=v_A_5, i=v_i_13, maxa=v_maxa_6, maxb=v_maxb_10, B=v_B_7} OutVars{A=v_A_5, i=v_i_12, maxa=v_maxa_5, maxb=v_maxb_9, B=v_B_7} AuxVars[] AssignedVars[i, maxa, maxb]" [2025-04-26 16:23:54,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1207410010, now seen corresponding path program 1 times [2025-04-26 16:23:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030433093] [2025-04-26 16:23:54,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:54,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:54,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:54,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:54,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 1 times [2025-04-26 16:23:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593846866] [2025-04-26 16:23:54,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash -679847064, now seen corresponding path program 1 times [2025-04-26 16:23:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746650779] [2025-04-26 16:23:54,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:54,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:54,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,967 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:54,968 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:54,968 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:54,968 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:54,969 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:54,969 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,969 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:54,969 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:54,969 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-max.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:54,969 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:54,969 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:54,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,289 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:55,291 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:55,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:55,295 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:55,296 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:55,298 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:55,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:55,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:55,311 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:23:55,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:55,372 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:23:55,372 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:23:55,435 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:55,441 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:55,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:55,446 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:55,448 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:55,448 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:55,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:55,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:55,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:55,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:55,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:55,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:55,467 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:55,482 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:55,482 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:55,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:55,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:55,487 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:55,488 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:55,488 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:55,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:55,507 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:55,507 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:55,508 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:55,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:55,516 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:55,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:55,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:55,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:55,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:55,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:55,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:55,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:55,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:55,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:55,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:55,596 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:55,641 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:55,659 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 135 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:55,762 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 135 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 360 states and 1197 transitions. Complement of second has 7 states. [2025-04-26 16:23:55,765 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:55,768 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:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-26 16:23:55,777 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:55,777 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:55,777 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:23:55,778 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:55,778 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:23:55,778 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:55,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 360 states and 1197 transitions. [2025-04-26 16:23:55,791 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 91 [2025-04-26 16:23:55,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 360 states to 231 states and 785 transitions. [2025-04-26 16:23:55,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-04-26 16:23:55,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2025-04-26 16:23:55,800 INFO L74 IsDeterministic]: Start isDeterministic. Operand 231 states and 785 transitions. [2025-04-26 16:23:55,800 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:55,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 231 states and 785 transitions. [2025-04-26 16:23:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 785 transitions. [2025-04-26 16:23:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 171. [2025-04-26 16:23:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 171 states have (on average 3.4678362573099415) internal successors, (in total 593), 170 states have internal predecessors, (593), 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:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 593 transitions. [2025-04-26 16:23:55,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 171 states and 593 transitions. [2025-04-26 16:23:55,832 INFO L438 stractBuchiCegarLoop]: Abstraction has 171 states and 593 transitions. [2025-04-26 16:23:55,832 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:55,832 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 593 transitions. [2025-04-26 16:23:55,835 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 91 [2025-04-26 16:23:55,835 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:55,835 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:55,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:55,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:55,836 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_maxa_3 (select v_A_3 0)) InVars {A=v_A_3, maxa=v_maxa_3} OutVars{A=v_A_3, maxa=v_maxa_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_maxb_3) InVars {maxb=v_maxb_3, B=v_B_3} OutVars{maxb=v_maxb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_maxc_1) InVars {A=v_A_4, maxc=v_maxc_1, B=v_B_4} OutVars{A=v_A_4, maxc=v_maxc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:23:55,837 INFO L754 eck$LassoCheckResult]: Loop: "[86] L37-1-->L37: 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[]" "[88] L37-->L37-1: Formula: (and (= (store v_C_5 v_k_13 (+ (select v_B_9 v_k_13) (select v_A_7 v_k_13))) v_C_4) (= v_k_12 (+ v_k_13 1)) (= v_k_12 v_p_7)) InVars {A=v_A_7, k=v_k_13, C=v_C_5, B=v_B_9} OutVars{A=v_A_7, p=v_p_7, k=v_k_12, C=v_C_4, B=v_B_9} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 16:23:55,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1224995454, now seen corresponding path program 1 times [2025-04-26 16:23:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743164520] [2025-04-26 16:23:55,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:55,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:55,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:55,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:55,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:55,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-04-26 16:23:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384745429] [2025-04-26 16:23:55,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:55,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:55,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:55,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:55,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 399594944, now seen corresponding path program 1 times [2025-04-26 16:23:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103844731] [2025-04-26 16:23:55,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:55,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:55,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:55,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:55,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,973 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:55,974 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:55,974 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:55,974 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:55,974 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:55,974 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:55,974 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:55,974 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:55,974 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-max.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:55,974 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:55,974 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:55,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:55,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:56,104 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:56,104 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:56,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,107 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:56,108 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:56,109 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:56,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,123 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:56,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,132 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:56,133 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:56,135 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:56,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,149 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,155 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:56,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,157 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:56,158 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:56,159 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:56,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,174 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,180 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:56,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,183 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:56,184 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:56,185 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:56,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,202 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,208 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:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,210 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:56,211 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:56,213 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:56,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:56,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:56,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:56,225 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,230 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:56,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,232 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:56,233 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:56,234 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:56,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:56,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:56,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:56,245 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:56,251 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:56,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,253 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:56,254 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:56,255 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:56,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:56,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:56,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:56,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:56,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:56,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:56,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:56,280 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:56,280 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:56,282 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:56,283 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:56,284 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:56,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:23:56,301 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:56,301 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:56,301 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:23:56,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:56,307 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:56,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:56,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:56,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:56,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:56,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:56,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:56,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:56,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:56,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:56,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:56,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:56,356 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:56,356 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:56,356 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 593 transitions. cyclomatic complexity: 461 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:56,437 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 593 transitions. cyclomatic complexity: 461. 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 511 states and 1875 transitions. Complement of second has 6 states. [2025-04-26 16:23:56,437 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:56,438 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:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 16:23:56,438 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:56,438 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:56,438 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:23:56,438 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:56,438 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:23:56,438 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:56,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 1875 transitions. [2025-04-26 16:23:56,451 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-04-26 16:23:56,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 310 states and 1155 transitions. [2025-04-26 16:23:56,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2025-04-26 16:23:56,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2025-04-26 16:23:56,457 INFO L74 IsDeterministic]: Start isDeterministic. Operand 310 states and 1155 transitions. [2025-04-26 16:23:56,457 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:56,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 310 states and 1155 transitions. [2025-04-26 16:23:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states and 1155 transitions. [2025-04-26 16:23:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 254. [2025-04-26 16:23:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 3.8818897637795278) internal successors, (in total 986), 253 states have internal predecessors, (986), 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:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 986 transitions. [2025-04-26 16:23:56,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 986 transitions. [2025-04-26 16:23:56,475 INFO L438 stractBuchiCegarLoop]: Abstraction has 254 states and 986 transitions. [2025-04-26 16:23:56,475 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:56,475 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 986 transitions. [2025-04-26 16:23:56,477 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-04-26 16:23:56,477 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:56,477 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:56,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:56,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:56,478 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_maxa_3 (select v_A_3 0)) InVars {A=v_A_3, maxa=v_maxa_3} OutVars{A=v_A_3, maxa=v_maxa_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_maxb_3) InVars {maxb=v_maxb_3, B=v_B_3} OutVars{maxb=v_maxb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_maxc_1) InVars {A=v_A_4, maxc=v_maxc_1, B=v_B_4} OutVars{A=v_A_4, maxc=v_maxc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[103] L68-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:23:56,478 INFO L754 eck$LassoCheckResult]: Loop: "[90] L49-1-->L49: Formula: (< v_l_2 v_N_6) InVars {l=v_l_2, N=v_N_6} OutVars{l=v_l_2, N=v_N_6} AuxVars[] AssignedVars[]" "[93] L49-->L49-1: Formula: (<= v_p_4 v_l_7) InVars {p=v_p_4, l=v_l_7} OutVars{p=v_p_4, l=v_l_7} AuxVars[] AssignedVars[]" [2025-04-26 16:23:56,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash -679846487, now seen corresponding path program 1 times [2025-04-26 16:23:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:56,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773176449] [2025-04-26 16:23:56,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:56,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:56,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:56,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:56,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:56,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:56,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:56,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 3844, now seen corresponding path program 1 times [2025-04-26 16:23:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:56,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960939127] [2025-04-26 16:23:56,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:56,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:56,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:56,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:56,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:56,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:56,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:56,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -497442132, now seen corresponding path program 1 times [2025-04-26 16:23:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:56,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842317636] [2025-04-26 16:23:56,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:56,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:56,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:56,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:56,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:56,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:56,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:56,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:56,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:56,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:56,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:56,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:56,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:56,645 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:56 BoogieIcfgContainer [2025-04-26 16:23:56,646 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:56,646 INFO L158 Benchmark]: Toolchain (without parser) took 2591.57ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.1MB in the beginning and 27.6MB in the end (delta: 57.5MB). Peak memory consumption was 55.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:56,646 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:56,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.78ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:56,647 INFO L158 Benchmark]: Boogie Preprocessor took 31.28ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.2MB in the end (delta: 968.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:56,647 INFO L158 Benchmark]: RCFGBuilder took 218.35ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 70.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:56,647 INFO L158 Benchmark]: BuchiAutomizer took 2299.73ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 70.8MB in the beginning and 27.6MB in the end (delta: 43.2MB). Peak memory consumption was 42.9MB. Max. memory is 8.0GB. [2025-04-26 16:23:56,649 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.72ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.78ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.28ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.2MB in the end (delta: 968.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 218.35ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 70.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2299.73ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 70.8MB in the beginning and 27.6MB in the end (delta: 43.2MB). Peak memory consumption was 42.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 116 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 33 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp105 ukn56 mio100 lsp71 div100 bol100 ite100 ukn100 eq170 hnf93 smp100 dnf300 smp64 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 142ms VariablesStem: 5 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. The remainder module has 254 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; VAL [i=1, k=1, l=1, p=1] [L63] 0 assume 0 <= N; VAL [N=2, i=1, k=1, l=1, p=1] [L64] 0 assume maxa == A[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, p=1] [L65] 0 assume maxb == B[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, p=1] [L66] 0 assume maxc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; VAL [i=1, k=1, l=1, p=1] [L63] 0 assume 0 <= N; VAL [N=2, i=1, k=1, l=1, p=1] [L64] 0 assume maxa == A[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, p=1] [L65] 0 assume maxb == B[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, p=1] [L66] 0 assume maxc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, maxa=0, maxb=0, maxc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:23:56,670 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...