/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-max.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:14,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:15,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:15,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:15,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:15,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:15,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:15,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:15,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:15,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:15,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:15,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:15,034 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:15,034 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:15,035 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:15,035 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:15,035 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:15,035 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:15,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:15,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:15,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:15,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:15,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:15,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:15,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:15,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:15,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:15,037 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:15,037 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:15,037 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:15,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:15,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:15,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:15,258 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:15,259 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:15,261 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:56:15,262 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:56:15,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:15,280 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:15,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:15,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:15,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:15,287 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:56:15" (1/1) ... [2025-04-26 16:56:15,310 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:56:15" (1/1) ... [2025-04-26 16:56:15,316 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:15,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:15,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:15,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:15,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:15,322 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:56:15" (1/1) ... [2025-04-26 16:56:15,322 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:56:15" (1/1) ... [2025-04-26 16:56:15,323 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:56:15" (1/1) ... [2025-04-26 16:56:15,323 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:56:15" (1/1) ... [2025-04-26 16:56:15,328 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:56:15" (1/1) ... [2025-04-26 16:56:15,328 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:56:15" (1/1) ... [2025-04-26 16:56:15,330 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:56:15" (1/1) ... [2025-04-26 16:56:15,330 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:56:15" (1/1) ... [2025-04-26 16:56:15,331 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:56:15" (1/1) ... [2025-04-26 16:56:15,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:15,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:15,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:15,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:15,341 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:56:15" (1/1) ... [2025-04-26 16:56:15,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:15,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:15,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:15,386 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:15,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:15,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:15,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:15,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:15,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:15,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:15,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:15,388 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:15,423 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:15,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:15,486 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:15,486 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:15,503 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:15,504 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:15,504 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:15 BoogieIcfgContainer [2025-04-26 16:56:15,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:15,505 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:15,505 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:15,508 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:15,509 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:15,509 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:56:15" (1/2) ... [2025-04-26 16:56:15,511 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54d5fa0 and model type three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:15, skipping insertion in model container [2025-04-26 16:56:15,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:15,511 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:56:15" (2/2) ... [2025-04-26 16:56:15,512 INFO L376 chiAutomizerObserver]: Analyzing ICFG three-array-max.wvr.bpl [2025-04-26 16:56:15,559 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:15,592 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:15,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:15,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:15,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 91 flow [2025-04-26 16:56:15,656 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 16:56:15,658 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:15,661 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:56:15,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 91 flow [2025-04-26 16:56:15,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-04-26 16:56:15,664 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 29 transitions, 76 flow [2025-04-26 16:56:15,668 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:15,769 WARN L140 AmpleReduction]: Number of pruned transitions: 117 [2025-04-26 16:56:15,770 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:15,770 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 40 [2025-04-26 16:56:15,770 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 16:56:15,770 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:66 [2025-04-26 16:56:15,770 WARN L145 AmpleReduction]: Times succ was already a loop node:72 [2025-04-26 16:56:15,770 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:12 [2025-04-26 16:56:15,770 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:15,772 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,780 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:15,780 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:15,780 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:15,780 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:15,780 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:15,780 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:15,780 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:15,781 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:15,784 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,798 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 16:56:15,798 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:15,798 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:15,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:15,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:15,803 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:15,803 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,807 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 16:56:15,807 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:15,807 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:15,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:15,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:15,813 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:56:15,814 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:56:15,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1207410010, now seen corresponding path program 1 times [2025-04-26 16:56:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276526650] [2025-04-26 16:56:15,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:15,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:15,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:15,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:15,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 1 times [2025-04-26 16:56:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151581588] [2025-04-26 16:56:15,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:15,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:15,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -679847064, now seen corresponding path program 1 times [2025-04-26 16:56:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753214115] [2025-04-26 16:56:15,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:15,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:15,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:16,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:16,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,264 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:16,265 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:16,266 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:16,266 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:16,266 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:16,266 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,266 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:16,266 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:16,267 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-max.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:16,267 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:16,267 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:16,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,628 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:16,630 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:16,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,652 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:56:16,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,699 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:56:16,699 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:56:16,760 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,767 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:56:16,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:16,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:56:16,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:16,803 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:16,803 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:16,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:16,810 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:16,827 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:56:16,827 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:16,827 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:16,828 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:56:16,834 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:56:16,837 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:16,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:16,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:16,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:16,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:16,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:16,917 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:16,918 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:16,998 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 315 states and 658 transitions. Complement of second has 7 states. [2025-04-26 16:56:16,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:17,002 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:56:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-26 16:56:17,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:17,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:17,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:56:17,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:17,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:56:17,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:17,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 658 transitions. [2025-04-26 16:56:17,019 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:17,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 155 states and 317 transitions. [2025-04-26 16:56:17,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-04-26 16:56:17,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-04-26 16:56:17,027 INFO L74 IsDeterministic]: Start isDeterministic. Operand 155 states and 317 transitions. [2025-04-26 16:56:17,027 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:17,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 317 transitions. [2025-04-26 16:56:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 317 transitions. [2025-04-26 16:56:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2025-04-26 16:56:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 2.099236641221374) internal successors, (in total 275), 130 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 275 transitions. [2025-04-26 16:56:17,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 16:56:17,052 INFO L438 stractBuchiCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 16:56:17,052 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:17,052 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 275 transitions. [2025-04-26 16:56:17,053 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:17,053 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:17,053 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:17,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:17,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:17,054 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]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[83] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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:56:17,054 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:56:17,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash 399576604, now seen corresponding path program 1 times [2025-04-26 16:56:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063355039] [2025-04-26 16:56:17,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:17,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:17,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:17,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:17,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-04-26 16:56:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175853819] [2025-04-26 16:56:17,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:17,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:17,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1741029854, now seen corresponding path program 1 times [2025-04-26 16:56:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147189814] [2025-04-26 16:56:17,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:17,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:17,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:17,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:17,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147189814] [2025-04-26 16:56:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147189814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:17,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:17,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540104006] [2025-04-26 16:56:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:17,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:17,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:17,203 INFO L87 Difference]: Start difference. First operand 131 states and 275 transitions. cyclomatic complexity: 171 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:17,263 INFO L93 Difference]: Finished difference Result 147 states and 297 transitions. [2025-04-26 16:56:17,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 297 transitions. [2025-04-26 16:56:17,265 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 57 [2025-04-26 16:56:17,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 297 transitions. [2025-04-26 16:56:17,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-04-26 16:56:17,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-04-26 16:56:17,269 INFO L74 IsDeterministic]: Start isDeterministic. Operand 147 states and 297 transitions. [2025-04-26 16:56:17,269 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:17,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 297 transitions. [2025-04-26 16:56:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 297 transitions. [2025-04-26 16:56:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2025-04-26 16:56:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 2.074626865671642) internal successors, (in total 278), 133 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 278 transitions. [2025-04-26 16:56:17,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 278 transitions. [2025-04-26 16:56:17,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:56:17,286 INFO L438 stractBuchiCegarLoop]: Abstraction has 134 states and 278 transitions. [2025-04-26 16:56:17,286 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:17,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 278 transitions. [2025-04-26 16:56:17,287 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:17,287 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:17,287 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:17,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:17,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:17,288 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]" "[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[]" "[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]" "[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]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:17,288 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:56:17,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash -497981451, now seen corresponding path program 1 times [2025-04-26 16:56:17,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23952759] [2025-04-26 16:56:17,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:17,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:17,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:17,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:17,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 2 times [2025-04-26 16:56:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219633640] [2025-04-26 16:56:17,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:17,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:17,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:17,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:17,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:17,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1818801801, now seen corresponding path program 1 times [2025-04-26 16:56:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902531875] [2025-04-26 16:56:17,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:17,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:17,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:17,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:17,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,565 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:17,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:17,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:17,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:17,565 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:17,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,565 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:17,565 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:17,565 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-max.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:17,565 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:17,565 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:17,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,009 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:18,009 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:18,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:18,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,034 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:56:18,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:18,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:18,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,086 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:18,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,103 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:18,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,111 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:18,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,139 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:18,148 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:56:18,148 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:18,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,150 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:18,153 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:18,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,172 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:18,172 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:18,172 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:56:18,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,181 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:18,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:18,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:18,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:18,236 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:18,236 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 278 transitions. cyclomatic complexity: 171 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:18,279 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 278 transitions. cyclomatic complexity: 171. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 289 states and 610 transitions. Complement of second has 6 states. [2025-04-26 16:56:18,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 16:56:18,280 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:56:18,280 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,280 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:56:18,280 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,280 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:56:18,280 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 610 transitions. [2025-04-26 16:56:18,283 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:18,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 195 states and 400 transitions. [2025-04-26 16:56:18,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:56:18,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2025-04-26 16:56:18,285 INFO L74 IsDeterministic]: Start isDeterministic. Operand 195 states and 400 transitions. [2025-04-26 16:56:18,285 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:18,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 400 transitions. [2025-04-26 16:56:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 400 transitions. [2025-04-26 16:56:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2025-04-26 16:56:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 160 states have (on average 2.09375) internal successors, (in total 335), 159 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 335 transitions. [2025-04-26 16:56:18,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 160 states and 335 transitions. [2025-04-26 16:56:18,293 INFO L438 stractBuchiCegarLoop]: Abstraction has 160 states and 335 transitions. [2025-04-26 16:56:18,293 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:18,293 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 335 transitions. [2025-04-26 16:56:18,294 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:18,294 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:18,294 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:18,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:18,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:18,294 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]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[83] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[85] L37-1-->thread2FINAL: Formula: (<= v_N_3 v_k_1) InVars {k=v_k_1, N=v_N_3} OutVars{k=v_k_1, N=v_N_3} AuxVars[] AssignedVars[]" "[87] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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:56:18,294 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:56:18,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1862650263, now seen corresponding path program 1 times [2025-04-26 16:56:18,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763694048] [2025-04-26 16:56:18,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:18,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:18,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:18,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:18,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash 3844, now seen corresponding path program 1 times [2025-04-26 16:56:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735268660] [2025-04-26 16:56:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 994462572, now seen corresponding path program 1 times [2025-04-26 16:56:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511885511] [2025-04-26 16:56:18,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:18,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:18,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,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:56:18,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:18,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511885511] [2025-04-26 16:56:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511885511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:18,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:18,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474538049] [2025-04-26 16:56:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:18,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:18,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:18,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:18,370 INFO L87 Difference]: Start difference. First operand 160 states and 335 transitions. cyclomatic complexity: 203 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:18,407 INFO L93 Difference]: Finished difference Result 165 states and 340 transitions. [2025-04-26 16:56:18,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 340 transitions. [2025-04-26 16:56:18,409 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:18,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 159 states and 334 transitions. [2025-04-26 16:56:18,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2025-04-26 16:56:18,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2025-04-26 16:56:18,411 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159 states and 334 transitions. [2025-04-26 16:56:18,411 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:18,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 334 transitions. [2025-04-26 16:56:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 334 transitions. [2025-04-26 16:56:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-04-26 16:56:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.1082802547770703) internal successors, (in total 331), 156 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 331 transitions. [2025-04-26 16:56:18,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 331 transitions. [2025-04-26 16:56:18,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:18,421 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 331 transitions. [2025-04-26 16:56:18,421 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:18,421 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 331 transitions. [2025-04-26 16:56:18,422 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:18,422 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:18,422 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:18,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:18,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:18,423 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]" "[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[]" "[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]" "[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]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[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[]" "[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:56:18,423 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:56:18,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1818801786, now seen corresponding path program 1 times [2025-04-26 16:56:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313123018] [2025-04-26 16:56:18,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:18,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:18,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:18,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:18,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 3844, now seen corresponding path program 2 times [2025-04-26 16:56:18,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850306736] [2025-04-26 16:56:18,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:18,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:18,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 183176009, now seen corresponding path program 1 times [2025-04-26 16:56:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712220310] [2025-04-26 16:56:18,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:18,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:18,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:18,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:18,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:18,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:18,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:18,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:18,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:18,692 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:18 BoogieIcfgContainer [2025-04-26 16:56:18,692 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:18,693 INFO L158 Benchmark]: Toolchain (without parser) took 3412.56ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 92.3MB in the beginning and 33.1MB in the end (delta: 59.2MB). Peak memory consumption was 38.3MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,693 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 167.8MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:18,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.18ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 90.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,693 INFO L158 Benchmark]: Boogie Preprocessor took 20.91ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 89.5MB in the end (delta: 960.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:18,694 INFO L158 Benchmark]: RCFGBuilder took 164.64ms. Allocated memory is still 167.8MB. Free memory was 89.4MB in the beginning and 79.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,694 INFO L158 Benchmark]: BuchiAutomizer took 3187.55ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 79.1MB in the beginning and 33.1MB in the end (delta: 46.0MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,697 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.76ms. Allocated memory is still 167.8MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.18ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 90.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.91ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 89.5MB in the end (delta: 960.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 164.64ms. Allocated memory is still 167.8MB. Free memory was 89.4MB in the beginning and 79.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3187.55ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 79.1MB in the beginning and 33.1MB in the end (delta: 46.0MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 74 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 64 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital107 mio100 ax100 hnf100 lsp125 ukn49 mio100 lsp71 div100 bol100 ite100 ukn100 eq170 hnf95 smp100 dnf775 smp27 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 128ms 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 182, Number of transitions in reduction automaton: 268, Number of states in reduction automaton: 133, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 157 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] [L24] COND TRUE 1 i < N 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] [L26] 1 maxa := (if maxa > A[i] then maxa else A[i]); [L27] 1 maxb := (if maxb > B[i] then maxb else B[i]); [L28] 1 i := i + 1; VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, maxc=0, p=1] [L24] COND FALSE 1 !(i < N) VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, maxc=0, p=1] [L36] COND TRUE 2 k < N VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, maxc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, 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] [L24] COND TRUE 1 i < N 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] [L26] 1 maxa := (if maxa > A[i] then maxa else A[i]); [L27] 1 maxb := (if maxb > B[i] then maxb else B[i]); [L28] 1 i := i + 1; VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, maxc=0, p=1] [L24] COND FALSE 1 !(i < N) VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, maxc=0, p=1] [L36] COND TRUE 2 k < N VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, maxc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=2, k=1, l=1, maxa=10444, maxb=18883, 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:56:18,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...