/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/POPL2023/sumsumsampleabs2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:41,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:41,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:41,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:41,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:41,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:41,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:41,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:41,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:41,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:41,158 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:41,158 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:41,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:41,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:41,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:41,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:41,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:41,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:41,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:41,160 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:41,160 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:41,160 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:41,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:41,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:41,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:41,392 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:41,392 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:41,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl [2025-04-26 18:39:41,395 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl' [2025-04-26 18:39:41,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:41,414 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:41,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:41,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:41,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:41,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,452 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:41,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:41,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:41,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:41,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:41,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:41,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:41,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:41,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:41,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:41,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:41,511 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:39:41,514 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:39:41,535 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2025-04-26 18:39:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2025-04-26 18:39:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2025-04-26 18:39:41,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2025-04-26 18:39:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2025-04-26 18:39:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2025-04-26 18:39:41,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure bank given in one single declaration [2025-04-26 18:39:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure bank [2025-04-26 18:39:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure bank [2025-04-26 18:39:41,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:41,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 18:39:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 18:39:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 18:39:41,537 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:39:41,576 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:41,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:41,676 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:41,676 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:41,685 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:41,685 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:41,686 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:41 BoogieIcfgContainer [2025-04-26 18:39:41,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:41,688 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:41,688 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:41,693 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:41,694 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:41,694 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/2) ... [2025-04-26 18:39:41,695 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49f23f28 and model type sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:41, skipping insertion in model container [2025-04-26 18:39:41,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:41,695 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:41" (2/2) ... [2025-04-26 18:39:41,696 INFO L376 chiAutomizerObserver]: Analyzing ICFG sumsumsampleabs2.bpl [2025-04-26 18:39:41,743 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:41,782 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:41,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:41,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:41,784 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:39:41,786 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:39:41,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 102 flow [2025-04-26 18:39:41,858 INFO L116 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-04-26 18:39:41,860 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:41,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 18:39:41,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 102 flow [2025-04-26 18:39:41,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 82 flow [2025-04-26 18:39:41,870 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 32 transitions, 82 flow [2025-04-26 18:39:41,870 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 32 transitions, 82 flow [2025-04-26 18:39:42,030 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1669 states, 1667 states have (on average 3.6736652669466108) internal successors, (in total 6124), 1668 states have internal predecessors, (6124), 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:39:42,036 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 1669 states, 1667 states have (on average 3.6736652669466108) internal successors, (in total 6124), 1668 states have internal predecessors, (6124), 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:39:42,039 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:42,303 WARN L140 AmpleReduction]: Number of pruned transitions: 1522 [2025-04-26 18:39:42,303 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:42,303 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 202 [2025-04-26 18:39:42,303 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:30 [2025-04-26 18:39:42,303 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:615 [2025-04-26 18:39:42,303 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:39:42,303 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:330 [2025-04-26 18:39:42,304 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:42,306 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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:39:42,312 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:42,312 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:42,312 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:42,312 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:42,312 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:42,312 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:42,312 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:42,312 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:42,315 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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:39:42,358 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 637 [2025-04-26 18:39:42,361 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:42,361 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:42,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:39:42,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:42,365 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:42,367 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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:39:42,379 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 637 [2025-04-26 18:39:42,380 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:42,380 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:42,380 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:39:42,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:42,385 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" [2025-04-26 18:39:42,385 INFO L754 eck$LassoCheckResult]: Loop: "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[81] L24-->L25: Formula: (= (+ v_sum1_3 (let ((.cse0 (select v_A_1 v_i1_3))) (ite (< .cse0 0) (- .cse0) .cse0))) v_sum1_2) InVars {sum1=v_sum1_3, A=v_A_1, i1=v_i1_3} OutVars{sum1=v_sum1_2, A=v_A_1, i1=v_i1_3} AuxVars[] AssignedVars[sum1]" "[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1]" [2025-04-26 18:39:42,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash 4034789, now seen corresponding path program 1 times [2025-04-26 18:39:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:42,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48806589] [2025-04-26 18:39:42,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:42,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:42,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:42,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:42,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:42,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:42,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:42,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash 108303, now seen corresponding path program 1 times [2025-04-26 18:39:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:42,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086602964] [2025-04-26 18:39:42,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:42,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:42,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:42,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:42,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:42,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:42,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:42,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash -58606677, now seen corresponding path program 1 times [2025-04-26 18:39:42,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:42,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185986487] [2025-04-26 18:39:42,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:42,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:42,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:42,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:42,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:42,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:42,641 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:42,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:42,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:42,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:42,641 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:42,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:42,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:42,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:42,642 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:42,642 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:42,642 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:42,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:42,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:42,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:42,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:42,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:42,859 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:42,861 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:42,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:42,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:42,865 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:39:42,866 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:39:42,867 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:39:42,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:42,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:42,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:42,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:42,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:42,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:42,903 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:42,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:39:42,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:42,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:42,913 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:39:42,914 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:39:42,917 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:39:42,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:42,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:42,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:42,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:42,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:42,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:42,955 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:42,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:42,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:42,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:42,965 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:39:42,966 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:39:42,969 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:39:42,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:42,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:42,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:42,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:42,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:42,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:42,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:42,983 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:42,989 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:39:42,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:42,991 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:39:42,992 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:39:42,994 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:39:43,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:43,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:43,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:43,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:43,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:43,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:43,011 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:43,017 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:39:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,019 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:39:43,021 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:39:43,022 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:39:43,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:43,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:43,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:43,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:43,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:43,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:43,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:43,050 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:39:43,050 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:43,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,054 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:39:43,055 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:39:43,056 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:43,075 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:39:43,075 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:43,075 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:43,075 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2025-04-26 18:39:43,081 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:39:43,088 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:43,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:43,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:43,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:43,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:43,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:43,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:43,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:43,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:43,156 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:39:43,171 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:39:43,174 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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:39:43,312 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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 1935 states and 3855 transitions. Complement of second has 6 states. [2025-04-26 18:39:43,313 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:39:43,316 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:39:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 18:39:43,319 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:39:43,320 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:43,320 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:39:43,320 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:43,320 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:39:43,320 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:43,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1935 states and 3855 transitions. [2025-04-26 18:39:43,338 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 245 [2025-04-26 18:39:43,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1935 states to 1078 states and 2055 transitions. [2025-04-26 18:39:43,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-04-26 18:39:43,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 584 [2025-04-26 18:39:43,360 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1078 states and 2055 transitions. [2025-04-26 18:39:43,361 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:43,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1078 states and 2055 transitions. [2025-04-26 18:39:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states and 2055 transitions. [2025-04-26 18:39:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 935. [2025-04-26 18:39:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 935 states have (on average 1.9700534759358288) internal successors, (in total 1842), 934 states have internal predecessors, (1842), 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:39:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1842 transitions. [2025-04-26 18:39:43,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 935 states and 1842 transitions. [2025-04-26 18:39:43,424 INFO L438 stractBuchiCegarLoop]: Abstraction has 935 states and 1842 transitions. [2025-04-26 18:39:43,424 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:43,424 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 935 states and 1842 transitions. [2025-04-26 18:39:43,429 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 245 [2025-04-26 18:39:43,429 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:43,429 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:43,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:43,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:43,430 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[90] $Ultimate##0-->L46: Formula: (= v_B_1 (store v_B_2 (+ (- 1) v_i1_7) v_sum1_4)) InVars {sum1=v_sum1_4, i1=v_i1_7, B=v_B_2} OutVars{sum1=v_sum1_4, i1=v_i1_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" "[78] L23-1-->sum1FINAL: Formula: (<= v_N_2 v_i1_6) InVars {i1=v_i1_6, N=v_N_2} OutVars{i1=v_i1_6, N=v_N_2} AuxVars[] AssignedVars[]" "[80] sum1FINAL-->sum1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y]" "[83] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2]" "[84] L34-->L35-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2]" [2025-04-26 18:39:43,430 INFO L754 eck$LassoCheckResult]: Loop: "[86] L35-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[]" "[88] L36-->L37: Formula: (= (+ (let ((.cse0 (select v_A_2 v_i2_2))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_2) v_sum2_1) InVars {A=v_A_2, sum2=v_sum2_2, i2=v_i2_2} OutVars{A=v_A_2, sum2=v_sum2_1, i2=v_i2_2} AuxVars[] AssignedVars[sum2]" "[89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" [2025-04-26 18:39:43,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -217770765, now seen corresponding path program 1 times [2025-04-26 18:39:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804558966] [2025-04-26 18:39:43,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:43,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:43,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:43,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:43,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash 115254, now seen corresponding path program 1 times [2025-04-26 18:39:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936831541] [2025-04-26 18:39:43,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2086809604, now seen corresponding path program 1 times [2025-04-26 18:39:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240670935] [2025-04-26 18:39:43,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:43,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:43,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:43,521 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:39:43,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:43,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240670935] [2025-04-26 18:39:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240670935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:43,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98562904] [2025-04-26 18:39:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:43,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:43,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:43,569 INFO L87 Difference]: Start difference. First operand 935 states and 1842 transitions. cyclomatic complexity: 1026 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 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:39:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:43,666 INFO L93 Difference]: Finished difference Result 976 states and 1896 transitions. [2025-04-26 18:39:43,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 976 states and 1896 transitions. [2025-04-26 18:39:43,672 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 263 [2025-04-26 18:39:43,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 976 states to 976 states and 1896 transitions. [2025-04-26 18:39:43,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2025-04-26 18:39:43,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2025-04-26 18:39:43,678 INFO L74 IsDeterministic]: Start isDeterministic. Operand 976 states and 1896 transitions. [2025-04-26 18:39:43,678 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:43,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 976 states and 1896 transitions. [2025-04-26 18:39:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states and 1896 transitions. [2025-04-26 18:39:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 944. [2025-04-26 18:39:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 944 states have (on average 1.9629237288135593) internal successors, (in total 1853), 943 states have internal predecessors, (1853), 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:39:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1853 transitions. [2025-04-26 18:39:43,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1853 transitions. [2025-04-26 18:39:43,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:39:43,697 INFO L438 stractBuchiCegarLoop]: Abstraction has 944 states and 1853 transitions. [2025-04-26 18:39:43,697 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:43,697 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 944 states and 1853 transitions. [2025-04-26 18:39:43,701 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 245 [2025-04-26 18:39:43,701 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:43,701 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:43,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:43,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:43,702 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[81] L24-->L25: Formula: (= (+ v_sum1_3 (let ((.cse0 (select v_A_1 v_i1_3))) (ite (< .cse0 0) (- .cse0) .cse0))) v_sum1_2) InVars {sum1=v_sum1_3, A=v_A_1, i1=v_i1_3} OutVars{sum1=v_sum1_2, A=v_A_1, i1=v_i1_3} AuxVars[] AssignedVars[sum1]" "[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y]" "[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1]" "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[110] L70-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j]" "[93] $Ultimate##0-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 18:39:43,702 INFO L754 eck$LassoCheckResult]: Loop: "[95] L57-1-->L58: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_5) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} AuxVars[] AssignedVars[]" "[97] L58-->L59: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A]" "[98] L59-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 18:39:43,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,702 INFO L85 PathProgramCache]: Analyzing trace with hash 706524784, now seen corresponding path program 1 times [2025-04-26 18:39:43,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984576404] [2025-04-26 18:39:43,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:43,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:43,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:43,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash 124191, now seen corresponding path program 1 times [2025-04-26 18:39:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545242862] [2025-04-26 18:39:43,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1554783152, now seen corresponding path program 1 times [2025-04-26 18:39:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25057786] [2025-04-26 18:39:43,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:43,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:43,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:43,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:43,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,977 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:43,977 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:43,977 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:43,977 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:43,977 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:43,977 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,977 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:43,977 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:43,977 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:43,977 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:43,977 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:43,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,200 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:44,200 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,204 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:39:44,205 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:39:44,207 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:39:44,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,228 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:39:44,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,230 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:39:44,230 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:39:44,231 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:39:44,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,245 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,253 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:44,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:44,256 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:39:44,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,269 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:39:44,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,277 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:39:44,278 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:39:44,280 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:39:44,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,294 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,300 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:39:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,302 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:39:44,303 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:39:44,305 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:39:44,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,319 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:44,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,329 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:39:44,331 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:39:44,332 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:39:44,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,348 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:44,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,357 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:39:44,358 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:39:44,358 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:39:44,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,368 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:44,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,371 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:44,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,375 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,382 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:39:44,384 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:39:44,385 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:39:44,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:44,410 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:39:44,411 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,413 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:44,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:39:44,415 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:44,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:39:44,431 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:44,431 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:44,431 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2025-04-26 18:39:44,437 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:39:44,438 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:44,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:44,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:44,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:44,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:44,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:44,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:44,482 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:44,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:44,497 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:39:44,497 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:39:44,498 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 944 states and 1853 transitions. cyclomatic complexity: 1028 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:39:44,560 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 944 states and 1853 transitions. cyclomatic complexity: 1028. 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 1868 states and 3651 transitions. Complement of second has 6 states. [2025-04-26 18:39:44,561 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:39:44,562 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:39:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 18:39:44,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:39:44,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:44,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:39:44,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:44,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 18:39:44,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:44,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1868 states and 3651 transitions. [2025-04-26 18:39:44,574 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 111 [2025-04-26 18:39:44,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1868 states to 1114 states and 2156 transitions. [2025-04-26 18:39:44,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2025-04-26 18:39:44,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2025-04-26 18:39:44,582 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1114 states and 2156 transitions. [2025-04-26 18:39:44,582 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:44,582 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1114 states and 2156 transitions. [2025-04-26 18:39:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states and 2156 transitions. [2025-04-26 18:39:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1080. [2025-04-26 18:39:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1080 states have (on average 1.9546296296296297) internal successors, (in total 2111), 1079 states have internal predecessors, (2111), 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:39:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 2111 transitions. [2025-04-26 18:39:44,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1080 states and 2111 transitions. [2025-04-26 18:39:44,627 INFO L438 stractBuchiCegarLoop]: Abstraction has 1080 states and 2111 transitions. [2025-04-26 18:39:44,627 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:44,627 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1080 states and 2111 transitions. [2025-04-26 18:39:44,631 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 111 [2025-04-26 18:39:44,631 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:44,631 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:44,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:44,632 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:44,632 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[90] $Ultimate##0-->L46: Formula: (= v_B_1 (store v_B_2 (+ (- 1) v_i1_7) v_sum1_4)) InVars {sum1=v_sum1_4, i1=v_i1_7, B=v_B_2} OutVars{sum1=v_sum1_4, i1=v_i1_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[81] L24-->L25: Formula: (= (+ v_sum1_3 (let ((.cse0 (select v_A_1 v_i1_3))) (ite (< .cse0 0) (- .cse0) .cse0))) v_sum1_2) InVars {sum1=v_sum1_3, A=v_A_1, i1=v_i1_3} OutVars{sum1=v_sum1_2, A=v_A_1, i1=v_i1_3} AuxVars[] AssignedVars[sum1]" "[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1]" "[78] L23-1-->sum1FINAL: Formula: (<= v_N_2 v_i1_6) InVars {i1=v_i1_6, N=v_N_2} OutVars{i1=v_i1_6, N=v_N_2} AuxVars[] AssignedVars[]" "[80] sum1FINAL-->sum1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y]" "[83] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2]" "[84] L34-->L35-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2]" [2025-04-26 18:39:44,632 INFO L754 eck$LassoCheckResult]: Loop: "[86] L35-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[]" "[88] L36-->L37: Formula: (= (+ (let ((.cse0 (select v_A_2 v_i2_2))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_2) v_sum2_1) InVars {A=v_A_2, sum2=v_sum2_2, i2=v_i2_2} OutVars{A=v_A_2, sum2=v_sum2_1, i2=v_i2_2} AuxVars[] AssignedVars[sum2]" "[89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" [2025-04-26 18:39:44,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -298289199, now seen corresponding path program 1 times [2025-04-26 18:39:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947196965] [2025-04-26 18:39:44,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:44,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:44,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:44,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:44,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash 115254, now seen corresponding path program 2 times [2025-04-26 18:39:44,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651792329] [2025-04-26 18:39:44,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:44,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:44,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash -46106522, now seen corresponding path program 1 times [2025-04-26 18:39:44,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031931711] [2025-04-26 18:39:44,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:39:44,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:39:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:39:44,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:39:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,809 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:44,809 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:44,809 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:44,809 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:44,810 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:44,810 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,810 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:44,810 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:44,810 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:39:44,810 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:44,810 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:44,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,053 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:45,053 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:45,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,055 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:45,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:39:45,058 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:39:45,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,072 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:39:45,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,080 INFO L229 MonitoredProcess]: Starting monitored process 19 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:39:45,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:39:45,084 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:39:45,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,098 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:39:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,106 INFO L229 MonitoredProcess]: Starting monitored process 20 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:39:45,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:39:45,108 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:39:45,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,125 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,133 INFO L229 MonitoredProcess]: Starting monitored process 21 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:39:45,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:39:45,136 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:39:45,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,151 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:39:45,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,158 INFO L229 MonitoredProcess]: Starting monitored process 22 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:39:45,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:39:45,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:45,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:45,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:45,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:45,170 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:39:45,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,177 INFO L229 MonitoredProcess]: Starting monitored process 23 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:39:45,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:39:45,179 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:39:45,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,192 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:39:45,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,200 INFO L229 MonitoredProcess]: Starting monitored process 24 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:39:45,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:39:45,201 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:39:45,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,211 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:45,211 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:39:45,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,218 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 18:39:45,218 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:39:45,229 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:39:45,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,237 INFO L229 MonitoredProcess]: Starting monitored process 25 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:39:45,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:39:45,238 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:39:45,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,251 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:39:45,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,261 INFO L229 MonitoredProcess]: Starting monitored process 26 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:39:45,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:39:45,264 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:39:45,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,282 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:45,293 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:45,293 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:45,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,295 INFO L229 MonitoredProcess]: Starting monitored process 27 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:39:45,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:39:45,297 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:45,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:39:45,312 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:45,312 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:45,312 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 18:39:45,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:45,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:45,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:45,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:45,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,372 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:39:45,373 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:39:45,373 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1080 states and 2111 transitions. cyclomatic complexity: 1152 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:39:45,428 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1080 states and 2111 transitions. cyclomatic complexity: 1152. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 2127 states and 4141 transitions. Complement of second has 6 states. [2025-04-26 18:39:45,428 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:39:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:39:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 18:39:45,429 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:39:45,429 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,429 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 18:39:45,429 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,430 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 13 letters. Loop has 6 letters. [2025-04-26 18:39:45,430 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2127 states and 4141 transitions. [2025-04-26 18:39:45,455 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:45,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2127 states to 0 states and 0 transitions. [2025-04-26 18:39:45,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:45,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:45,455 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:45,455 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:45,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:45,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:45,455 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:45,455 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:45,455 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:45,455 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:45,455 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:45,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,470 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:45 BoogieIcfgContainer [2025-04-26 18:39:45,470 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:45,470 INFO L158 Benchmark]: Toolchain (without parser) took 4056.48ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 86.7MB in the beginning and 161.2MB in the end (delta: -74.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:45,471 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.74ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:45,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.04ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:45,471 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:45,471 INFO L158 Benchmark]: RCFGBuilder took 202.49ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.2MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:45,471 INFO L158 Benchmark]: BuchiAutomizer took 3781.89ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 74.2MB in the beginning and 161.2MB in the end (delta: -87.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:45,472 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.74ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.04ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 202.49ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.2MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3781.89ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 74.2MB in the beginning and 161.2MB in the end (delta: -87.0MB). 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.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 209 StatesRemovedByMinimization, 3 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, 247 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 131 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital90 mio100 ax100 hnf100 lsp128 ukn42 mio100 lsp64 div100 bol100 ite100 ukn100 eq164 hnf98 smp100 dnf201 smp52 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 527, Number of transitions in reduction automaton: 1620, Number of states in reduction automaton: 848, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:45,483 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...