/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:09,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:09,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:09,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:09,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:09,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:09,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:09,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:09,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:09,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:09,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:09,852 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:09,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:09,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:09,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:09,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:09,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:09,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:09,855 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:09,855 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:09,855 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:10,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:10,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:10,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:10,094 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:10,094 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:10,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl [2025-04-26 18:41:10,096 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl' [2025-04-26 18:41:10,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:10,116 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:10,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:10,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:10,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:10,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,153 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:10,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:10,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:10,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:10,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:10,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:10,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:10,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:10,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:10,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/1) ... [2025-04-26 18:41:10,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:10,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:10,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:10,229 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:10,229 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:10,229 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:10,229 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:10,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:10,230 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:10,268 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:10,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:10,353 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:10,353 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:10,365 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:10,365 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:10,366 INFO L201 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:10 BoogieIcfgContainer [2025-04-26 18:41:10,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:10,366 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:10,366 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:10,370 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:10,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:10,371 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:10" (1/2) ... [2025-04-26 18:41:10,372 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35a644fc and model type max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:10, skipping insertion in model container [2025-04-26 18:41:10,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:10,372 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:10" (2/2) ... [2025-04-26 18:41:10,373 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-array.wvr.bpl [2025-04-26 18:41:10,424 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:10,463 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:10,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:10,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:10,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:10,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:41:10,525 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 18:41:10,528 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:10,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:41:10,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:41:10,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:10,537 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:10,539 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:10,556 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 114 states, 112 states have (on average 2.8035714285714284) internal successors, (in total 314), 113 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:10,557 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 114 states, 112 states have (on average 2.8035714285714284) internal successors, (in total 314), 113 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:10,559 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:10,618 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:41:10,618 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:10,618 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:41:10,618 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 18:41:10,618 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:41:10,618 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:41:10,618 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:41:10,618 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:10,619 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:10,626 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:10,626 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:10,626 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:10,626 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:10,626 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:10,626 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:10,626 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:10,626 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:10,628 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:10,638 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:10,639 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,639 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:10,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:10,643 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:10,644 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:10,647 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:10,647 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,647 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:10,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:10,651 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:10,651 INFO L754 eck$LassoCheckResult]: Loop: "[68] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" [2025-04-26 18:41:10,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash 87601028, now seen corresponding path program 1 times [2025-04-26 18:41:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267272825] [2025-04-26 18:41:10,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:10,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:10,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:10,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:10,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 18:41:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447001526] [2025-04-26 18:41:10,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:10,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:10,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:10,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:10,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1714755834, now seen corresponding path program 1 times [2025-04-26 18:41:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271782925] [2025-04-26 18:41:10,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:10,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:10,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:10,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:10,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,909 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:10,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:10,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:10,909 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:10,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:10,910 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:10,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:10,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:10,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:10,910 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:10,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,164 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:11,167 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:11,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:11,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:11,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:11,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:11,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:11,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,271 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:41:11,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:11,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:11,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,301 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:11,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:11,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:11,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,324 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:11,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,340 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:11,340 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:11,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,358 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 18:41:11,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:11,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:11,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:11,399 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:11,399 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:41:11,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:11,419 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:11,436 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 18:41:11,436 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:11,436 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:11,436 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:41:11,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:11,445 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:11,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:11,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:11,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:11,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:11,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:11,522 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:11,524 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,602 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 260 states and 529 transitions. Complement of second has 7 states. [2025-04-26 18:41:11,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-26 18:41:11,610 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:11,610 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,610 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:11,610 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,610 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:41:11,612 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 529 transitions. [2025-04-26 18:41:11,621 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:11,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 119 states and 241 transitions. [2025-04-26 18:41:11,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 18:41:11,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 18:41:11,628 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 241 transitions. [2025-04-26 18:41:11,628 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:11,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 241 transitions. [2025-04-26 18:41:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 241 transitions. [2025-04-26 18:41:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2025-04-26 18:41:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.019230769230769) internal successors, (in total 210), 103 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 210 transitions. [2025-04-26 18:41:11,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 18:41:11,653 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 18:41:11,653 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:11,653 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 210 transitions. [2025-04-26 18:41:11,654 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:11,654 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:11,654 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:11,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:11,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:11,655 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L58-1-->L33-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 18:41:11,655 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-1-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_8 .cse0) .cse0 v_max2_8)) v_max2_7)) InVars {A=v_A_6, max2=v_max2_8, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_7, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 18:41:11,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1617824210, now seen corresponding path program 1 times [2025-04-26 18:41:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132397142] [2025-04-26 18:41:11,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:11,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:11,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:11,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:11,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132397142] [2025-04-26 18:41:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132397142] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:11,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740015516] [2025-04-26 18:41:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:11,746 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:11,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,746 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 18:41:11,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590467021] [2025-04-26 18:41:11,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:11,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:11,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:11,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:11,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:11,798 INFO L87 Difference]: Start difference. First operand 104 states and 210 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:11,841 INFO L93 Difference]: Finished difference Result 106 states and 212 transitions. [2025-04-26 18:41:11,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 212 transitions. [2025-04-26 18:41:11,842 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:11,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 212 transitions. [2025-04-26 18:41:11,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 18:41:11,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:41:11,843 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 212 transitions. [2025-04-26 18:41:11,844 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:11,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 18:41:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 212 transitions. [2025-04-26 18:41:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-04-26 18:41:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.0096153846153846) internal successors, (in total 209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 209 transitions. [2025-04-26 18:41:11,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 18:41:11,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:11,848 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 18:41:11,848 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:11,848 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 209 transitions. [2025-04-26 18:41:11,849 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:11,849 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:11,849 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:11,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:11,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:11,850 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L58-1-->L33-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]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[67] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:11,850 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-1-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_8 .cse0) .cse0 v_max2_8)) v_max2_7)) InVars {A=v_A_6, max2=v_max2_8, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_7, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 18:41:11,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1387100881, now seen corresponding path program 1 times [2025-04-26 18:41:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045971184] [2025-04-26 18:41:11,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:11,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:11,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 2 times [2025-04-26 18:41:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57911232] [2025-04-26 18:41:11,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:11,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:11,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:11,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:11,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1564087187, now seen corresponding path program 1 times [2025-04-26 18:41:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940705731] [2025-04-26 18:41:11,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:11,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:11,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940705731] [2025-04-26 18:41:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940705731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:11,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:11,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:41:11,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563140800] [2025-04-26 18:41:11,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:11,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:11,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:11,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:11,994 INFO L87 Difference]: Start difference. First operand 104 states and 209 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:12,084 INFO L93 Difference]: Finished difference Result 154 states and 290 transitions. [2025-04-26 18:41:12,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 290 transitions. [2025-04-26 18:41:12,085 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 18:41:12,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 152 states and 288 transitions. [2025-04-26 18:41:12,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 18:41:12,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 18:41:12,087 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 288 transitions. [2025-04-26 18:41:12,087 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:12,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 288 transitions. [2025-04-26 18:41:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 288 transitions. [2025-04-26 18:41:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2025-04-26 18:41:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.983739837398374) internal successors, (in total 244), 122 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 244 transitions. [2025-04-26 18:41:12,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 18:41:12,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:12,098 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 18:41:12,098 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:12,098 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 244 transitions. [2025-04-26 18:41:12,099 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:12,099 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:12,099 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:12,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:12,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:12,100 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L58-1-->L33-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]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[68] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[67] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:12,101 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-1-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_8 .cse0) .cse0 v_max2_8)) v_max2_7)) InVars {A=v_A_6, max2=v_max2_8, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_7, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 18:41:12,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1564088079, now seen corresponding path program 2 times [2025-04-26 18:41:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812659351] [2025-04-26 18:41:12,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 18:41:12,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:12,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:12,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:12,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 3 times [2025-04-26 18:41:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173214619] [2025-04-26 18:41:12,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:12,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:12,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:12,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:12,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:12,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash -149907375, now seen corresponding path program 2 times [2025-04-26 18:41:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609346674] [2025-04-26 18:41:12,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 18:41:12,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:12,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:12,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:12,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:12,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,434 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:12,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:12,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:12,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:12,434 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:12,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:12,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:12,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:12,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:12,434 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:12,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,834 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:12,834 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,838 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:12,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:12,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,862 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:12,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,873 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:12,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:12,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,889 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,895 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 18:41:12,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,897 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:12,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:12,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,909 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-04-26 18:41:12,909 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:12,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,921 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-04-26 18:41:12,921 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:12,938 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,943 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 18:41:12,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:12,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:12,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:12,971 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:12,971 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:41:12,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,973 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:12,976 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:12,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:12,991 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:12,992 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:12,992 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:41:12,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:13,003 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:13,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:13,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:13,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:13,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:13,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:13,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:13,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:13,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:13,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:13,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:13,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:13,056 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:13,056 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148 Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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 18:41:13,102 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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) Result 267 states and 557 transitions. Complement of second has 6 states. [2025-04-26 18:41:13,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) 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 18:41:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:41:13,103 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:13,103 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:13,103 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:13,103 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:13,103 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:13,103 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:13,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 557 transitions. [2025-04-26 18:41:13,106 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:13,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 158 states and 310 transitions. [2025-04-26 18:41:13,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 18:41:13,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 18:41:13,107 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 310 transitions. [2025-04-26 18:41:13,107 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:13,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 310 transitions. [2025-04-26 18:41:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 310 transitions. [2025-04-26 18:41:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-04-26 18:41:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 2.074380165289256) internal successors, (in total 251), 120 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 251 transitions. [2025-04-26 18:41:13,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 18:41:13,113 INFO L438 stractBuchiCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 18:41:13,113 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:13,113 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 251 transitions. [2025-04-26 18:41:13,113 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:13,113 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:13,113 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:13,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:13,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:13,114 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L58-1-->L33-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]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[87] L59-->L44-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]" "[67] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[71] L33-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:13,114 INFO L754 eck$LassoCheckResult]: Loop: "[76] L44-1-->L44: 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[]" "[78] L44-->L44-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= v_max2_11 (let ((.cse0 (select v_A_8 v_k_8))) (ite (< v_max2_12 .cse0) .cse0 v_max2_12)))) InVars {A=v_A_8, k=v_k_8, max2=v_max2_12} OutVars{A=v_A_8, k=v_k_7, max2=v_max2_11} AuxVars[] AssignedVars[k, max2]" [2025-04-26 18:41:13,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1564106249, now seen corresponding path program 1 times [2025-04-26 18:41:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:13,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378462604] [2025-04-26 18:41:13,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:13,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:13,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:13,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:13,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:13,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:13,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:13,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:13,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 18:41:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:13,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564404889] [2025-04-26 18:41:13,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:13,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:13,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:13,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:13,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:13,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:13,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:13,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -132445877, now seen corresponding path program 1 times [2025-04-26 18:41:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:13,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575778062] [2025-04-26 18:41:13,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:13,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:13,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:13,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:13,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:13,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:13,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:13,317 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:13,317 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:13,317 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:13,317 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:13,317 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:13,317 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:13,317 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:13,317 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:13,317 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:13,317 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:13,318 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:13,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:13,556 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:13,556 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:13,558 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:13,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:13,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:13,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:13,570 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:41:13,570 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:13,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:13,579 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 18:41:13,580 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:13,591 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:13,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:13,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:13,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:13,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:13,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:13,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:13,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:13,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:13,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:13,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:13,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:13,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:13,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:13,626 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:13,626 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:13,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:13,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:13,628 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:13,636 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:13,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:13,652 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:13,652 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:13,652 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:41:13,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:41:13,659 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:13,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:13,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:13,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:13,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:13,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:13,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:13,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:13,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:13,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:13,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:13,703 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:13,703 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:13,738 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 224 states and 442 transitions. Complement of second has 6 states. [2025-04-26 18:41:13,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:41:13,739 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:13,739 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:13,739 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:13,739 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:13,739 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:13,740 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:13,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 442 transitions. [2025-04-26 18:41:13,741 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:13,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2025-04-26 18:41:13,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:13,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:13,741 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:13,742 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:13,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:13,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:13,742 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:13,742 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:13,742 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:13,742 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:13,742 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:13,753 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 18:41:13,754 INFO L201 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:13 BoogieIcfgContainer [2025-04-26 18:41:13,755 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:13,755 INFO L158 Benchmark]: Toolchain (without parser) took 3639.50ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 95.9MB in the beginning and 100.6MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:13,756 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:13,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:13,757 INFO L158 Benchmark]: Boogie Preprocessor took 29.92ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 838.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:13,757 INFO L158 Benchmark]: RCFGBuilder took 179.38ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 82.9MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:13,758 INFO L158 Benchmark]: BuchiAutomizer took 3388.21ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.9MB in the beginning and 100.6MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:13,759 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.21ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.92ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 838.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 179.38ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 82.9MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3388.21ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.9MB in the beginning and 100.6MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 60 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp218 ukn43 mio100 lsp64 div100 bol100 ite100 ukn100 eq158 hnf94 smp100 dnf467 smp46 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 158, Number of transitions in reduction automaton: 227, Number of states in reduction automaton: 114, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:13,771 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...