/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:49,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:49,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:49,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:49,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:49,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:49,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:49,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:49,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:49,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:49,116 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:49,116 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:49,116 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:49,116 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:49,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:49,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:49,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:49,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:49,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:49,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:49,118 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:49,118 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:49,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:49,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:49,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:49,376 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:49,376 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:49,377 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 16:21:49,378 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl' [2025-04-26 16:21:49,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:49,396 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:49,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:49,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:49,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:49,404 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 04:21:49" (1/1) ... [2025-04-26 16:21:49,429 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 04:21:49" (1/1) ... [2025-04-26 16:21:49,435 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:49,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:49,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:49,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:49,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:49,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:49,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:49,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:49,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:49,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/1) ... [2025-04-26 16:21:49,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:49,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:49,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:49,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2025-04-26 16:21:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2025-04-26 16:21:49,508 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2025-04-26 16:21:49,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2025-04-26 16:21:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2025-04-26 16:21:49,508 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2025-04-26 16:21:49,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure bank given in one single declaration [2025-04-26 16:21:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure bank [2025-04-26 16:21:49,508 INFO L138 BoogieDeclarations]: Found implementation of procedure bank [2025-04-26 16:21:49,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:49,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:49,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 16:21:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 16:21:49,508 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 16:21:49,509 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:21:49,548 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:49,549 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:49,608 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:49,608 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:49,617 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:49,618 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:49,618 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:49 BoogieIcfgContainer [2025-04-26 16:21:49,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:49,620 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:49,620 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:49,624 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:49,624 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:49,624 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:49" (1/2) ... [2025-04-26 16:21:49,626 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ac9299f and model type sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:49, skipping insertion in model container [2025-04-26 16:21:49,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:49,626 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:49" (2/2) ... [2025-04-26 16:21:49,626 INFO L376 chiAutomizerObserver]: Analyzing ICFG sumsumsampleabs2.bpl [2025-04-26 16:21:49,676 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:49,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 102 flow [2025-04-26 16:21:49,729 INFO L116 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-04-26 16:21:49,731 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:49,734 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 16:21:49,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 102 flow [2025-04-26 16:21:49,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 82 flow [2025-04-26 16:21:49,737 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 32 transitions, 82 flow [2025-04-26 16:21:49,745 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:49,745 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:49,745 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:49,745 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:49,745 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:49,745 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:49,745 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:49,745 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:49,746 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:49,932 INFO L131 ngComponentsAnalysis]: Automaton has 296 accepting balls. 1296 [2025-04-26 16:21:49,932 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:49,932 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:49,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:49,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:49,936 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:49,936 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1668 states, but on-demand construction may add more states [2025-04-26 16:21:49,970 INFO L131 ngComponentsAnalysis]: Automaton has 296 accepting balls. 1296 [2025-04-26 16:21:49,970 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:49,970 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:49,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:49,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:49,974 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 16:21:49,975 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 16:21:49,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash 4034789, now seen corresponding path program 1 times [2025-04-26 16:21:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188381872] [2025-04-26 16:21:50,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:50,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:50,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 108303, now seen corresponding path program 1 times [2025-04-26 16:21:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609903854] [2025-04-26 16:21:50,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:50,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:50,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:50,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:50,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash -58606677, now seen corresponding path program 1 times [2025-04-26 16:21:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781556576] [2025-04-26 16:21:50,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:50,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:50,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:50,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:50,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,257 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:50,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:50,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:50,258 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:50,258 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:50,258 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,258 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:50,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:50,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:50,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:50,258 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:50,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,461 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:50,463 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:50,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:50,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:50,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:50,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:50,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:50,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:50,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:50,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:50,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:50,499 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:50,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:50,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:50,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:21:50,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:50,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:50,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:50,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:50,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:50,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:50,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:50,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:50,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:21:50,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:50,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:21:50,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:50,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:50,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:50,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:50,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:50,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:50,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:50,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:50,564 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:50,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:21:50,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:50,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:21:50,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:50,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:50,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:50,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:50,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:50,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:50,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:50,590 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:50,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:21:50,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:50,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:21:50,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:50,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:50,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:50,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:50,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:50,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:50,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:50,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:50,635 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:21:50,635 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:50,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:21:50,641 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:50,658 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 16:21:50,659 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:50,659 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:50,660 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2025-04-26 16:21:50,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:50,668 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:50,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:50,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:50,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:50,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:50,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:50,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:50,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:50,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:50,724 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:50,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:50,796 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:50,799 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 1668 states, but on-demand construction may add more states 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 16:21:50,973 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 1668 states, but on-demand construction may add more states. 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 3926 states and 16743 transitions. Complement of second has 6 states. [2025-04-26 16:21:50,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:50,981 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 16:21:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-26 16:21:50,988 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:21:50,989 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:50,989 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:21:50,989 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:50,989 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:21:50,989 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:50,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3926 states and 16743 transitions. [2025-04-26 16:21:51,053 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 1092 [2025-04-26 16:21:51,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3926 states to 2974 states and 12758 transitions. [2025-04-26 16:21:51,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2025-04-26 16:21:51,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2239 [2025-04-26 16:21:51,113 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2974 states and 12758 transitions. [2025-04-26 16:21:51,113 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:51,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2974 states and 12758 transitions. [2025-04-26 16:21:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states and 12758 transitions. [2025-04-26 16:21:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2427. [2025-04-26 16:21:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2427 states have (on average 4.340749896992172) internal successors, (in total 10535), 2426 states have internal predecessors, (10535), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 10535 transitions. [2025-04-26 16:21:51,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2427 states and 10535 transitions. [2025-04-26 16:21:51,259 INFO L438 stractBuchiCegarLoop]: Abstraction has 2427 states and 10535 transitions. [2025-04-26 16:21:51,259 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:51,259 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2427 states and 10535 transitions. [2025-04-26 16:21:51,274 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 1092 [2025-04-26 16:21:51,275 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:51,275 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:51,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:51,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:51,275 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]" "[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 16:21:51,276 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 16:21:51,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash 125108520, now seen corresponding path program 1 times [2025-04-26 16:21:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900140956] [2025-04-26 16:21:51,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash 115254, now seen corresponding path program 1 times [2025-04-26 16:21:51,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922482181] [2025-04-26 16:21:51,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:51,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:51,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:51,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:51,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash -923608145, now seen corresponding path program 1 times [2025-04-26 16:21:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113870606] [2025-04-26 16:21:51,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,424 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:51,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:51,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:51,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:51,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:51,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:51,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:51,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:51,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:51,425 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:51,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,585 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:51,585 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:51,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:21:51,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:51,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,610 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:21:51,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:51,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:21:51,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:51,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,637 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:21:51,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:51,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:21:51,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:51,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,664 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:21:51,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:51,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:21:51,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:51,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,685 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:51,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,691 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:51,691 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:51,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:21:51,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,710 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:51,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:21:51,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:51,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:51,734 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:21:51,734 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,736 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 16:21:51,738 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 16:21:51,739 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:51,756 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 16:21:51,756 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:51,756 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:51,756 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 16:21:51,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:51,764 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:51,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:51,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:51,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:51,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:51,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:51,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:51,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:51,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:51,835 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:51,835 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2427 states and 10535 transitions. cyclomatic complexity: 8496 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:51,984 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2427 states and 10535 transitions. cyclomatic complexity: 8496. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6423 states and 30303 transitions. Complement of second has 6 states. [2025-04-26 16:21:51,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-26 16:21:51,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:51,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:51,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:51,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6423 states and 30303 transitions. [2025-04-26 16:21:52,072 INFO L131 ngComponentsAnalysis]: Automaton has 240 accepting balls. 720 [2025-04-26 16:21:52,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6423 states to 4199 states and 19780 transitions. [2025-04-26 16:21:52,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1660 [2025-04-26 16:21:52,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2126 [2025-04-26 16:21:52,167 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4199 states and 19780 transitions. [2025-04-26 16:21:52,167 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:52,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4199 states and 19780 transitions. [2025-04-26 16:21:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states and 19780 transitions. [2025-04-26 16:21:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 3459. [2025-04-26 16:21:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3459 states have (on average 4.713211910956924) internal successors, (in total 16303), 3458 states have internal predecessors, (16303), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 16303 transitions. [2025-04-26 16:21:52,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3459 states and 16303 transitions. [2025-04-26 16:21:52,256 INFO L438 stractBuchiCegarLoop]: Abstraction has 3459 states and 16303 transitions. [2025-04-26 16:21:52,256 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:52,256 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3459 states and 16303 transitions. [2025-04-26 16:21:52,278 INFO L131 ngComponentsAnalysis]: Automaton has 240 accepting balls. 720 [2025-04-26 16:21:52,279 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:52,279 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:52,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:52,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:52,279 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]" "[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]" "[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 16:21:52,279 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 16:21:52,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,280 INFO L85 PathProgramCache]: Analyzing trace with hash 125109366, now seen corresponding path program 1 times [2025-04-26 16:21:52,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499791188] [2025-04-26 16:21:52,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:52,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:52,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:52,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:52,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 124191, now seen corresponding path program 1 times [2025-04-26 16:21:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368798812] [2025-04-26 16:21:52,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -898396022, now seen corresponding path program 1 times [2025-04-26 16:21:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988322339] [2025-04-26 16:21:52,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,474 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:52,474 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:52,474 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:52,474 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:52,474 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:52,474 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,474 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:52,474 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:52,474 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:52,474 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:52,474 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:52,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,611 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:52,611 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:52,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,613 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 16:21:52,614 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 16:21:52,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,630 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:21:52,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,638 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 16:21:52,640 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 16:21:52,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,656 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:21:52,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,664 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 16:21:52,666 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 16:21:52,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,680 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,688 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 16:21:52,689 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 16:21:52,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,704 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,710 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 16:21:52,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,713 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 16:21:52,714 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 16:21:52,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,727 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,734 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 16:21:52,735 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 16:21:52,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:52,757 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:52,757 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:52,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,759 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 16:21:52,761 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 16:21:52,762 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:52,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:21:52,779 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:52,779 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:52,779 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2025-04-26 16:21:52,785 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 16:21:52,786 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:52,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:52,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:52,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:52,829 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:52,829 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3459 states and 16303 transitions. cyclomatic complexity: 13288 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:53,022 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3459 states and 16303 transitions. cyclomatic complexity: 13288. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9293 states and 44878 transitions. Complement of second has 6 states. [2025-04-26 16:21:53,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 16:21:53,024 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:53,024 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,024 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:53,024 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,024 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:53,024 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9293 states and 44878 transitions. [2025-04-26 16:21:53,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:53,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9293 states to 0 states and 0 transitions. [2025-04-26 16:21:53,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:53,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:53,178 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:53,178 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:53,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:53,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:53,178 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:53,179 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:53,179 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:53,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:53,179 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:53,186 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:53 BoogieIcfgContainer [2025-04-26 16:21:53,186 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:53,186 INFO L158 Benchmark]: Toolchain (without parser) took 3790.32ms. Allocated memory was 184.5MB in the beginning and 201.3MB in the end (delta: 16.8MB). Free memory was 109.5MB in the beginning and 73.4MB in the end (delta: 36.1MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-26 16:21:53,187 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:53,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.55ms. Allocated memory is still 184.5MB. Free memory was 109.3MB in the beginning and 107.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:53,188 INFO L158 Benchmark]: Boogie Preprocessor took 19.99ms. Allocated memory is still 184.5MB. Free memory was 107.5MB in the beginning and 105.9MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:53,189 INFO L158 Benchmark]: RCFGBuilder took 160.09ms. Allocated memory is still 184.5MB. Free memory was 105.9MB in the beginning and 96.4MB in the end (delta: 9.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:53,190 INFO L158 Benchmark]: BuchiAutomizer took 3566.21ms. Allocated memory was 184.5MB in the beginning and 201.3MB in the end (delta: 16.8MB). Free memory was 96.2MB in the beginning and 73.4MB in the end (delta: 22.8MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-26 16:21:53,192 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.20ms. Allocated memory is still 184.5MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.55ms. Allocated memory is still 184.5MB. Free memory was 109.3MB in the beginning and 107.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.99ms. Allocated memory is still 184.5MB. Free memory was 107.5MB in the beginning and 105.9MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 160.09ms. Allocated memory is still 184.5MB. Free memory was 105.9MB in the beginning and 96.4MB in the end (delta: 9.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 3566.21ms. Allocated memory was 184.5MB in the beginning and 201.3MB in the end (delta: 16.8MB). Free memory was 96.2MB in the beginning and 73.4MB in the end (delta: 22.8MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 1287 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.3s 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, 206 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 271 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 141 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital66 mio100 ax100 hnf100 lsp114 ukn40 mio100 lsp75 div100 bol100 ite100 ukn100 eq168 hnf98 smp100 dnf146 smp70 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:21:53,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...