/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/sumsuminc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:47,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:47,234 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:47,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:47,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:47,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:47,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:47,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:47,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:47,258 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:47,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:47,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:47,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:47,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:47,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:47,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:47,261 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:47,261 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:47,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:47,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:47,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:47,488 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:47,489 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:47,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl [2025-04-26 16:21:47,493 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl' [2025-04-26 16:21:47,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:47,513 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:47,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:47,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:47,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:47,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,556 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:47,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:47,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:47,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:47,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:47,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:47,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:47,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:47,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:47,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/1) ... [2025-04-26 16:21:47,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:47,611 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:47,614 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:47,634 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2025-04-26 16:21:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2025-04-26 16:21:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2025-04-26 16:21:47,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2025-04-26 16:21:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2025-04-26 16:21:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2025-04-26 16:21:47,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:47,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2025-04-26 16:21:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2025-04-26 16:21:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2025-04-26 16:21:47,637 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:47,680 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:47,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:47,768 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:47,768 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:47,800 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:47,801 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:47,801 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:47 BoogieIcfgContainer [2025-04-26 16:21:47,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:47,802 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:47,802 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:47,808 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:47,808 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:47,808 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:47" (1/2) ... [2025-04-26 16:21:47,809 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fc75b6c and model type sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:47, skipping insertion in model container [2025-04-26 16:21:47,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:47,809 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:47" (2/2) ... [2025-04-26 16:21:47,810 INFO L376 chiAutomizerObserver]: Analyzing ICFG sumsuminc.bpl [2025-04-26 16:21:47,853 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:47,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 80 flow [2025-04-26 16:21:47,912 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-26 16:21:47,914 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:47,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 3/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 16:21:47,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 80 flow [2025-04-26 16:21:47,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 65 flow [2025-04-26 16:21:47,920 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 25 transitions, 65 flow [2025-04-26 16:21:47,928 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:47,928 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:47,928 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:47,928 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:47,928 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:47,928 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:47,928 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:47,928 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:47,929 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:48,004 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 180 [2025-04-26 16:21:48,005 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:48,005 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:48,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:48,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:48,008 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:48,008 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 272 states, but on-demand construction may add more states [2025-04-26 16:21:48,018 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 180 [2025-04-26 16:21:48,018 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:48,019 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:48,019 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:48,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:48,023 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0]" "[80] $Ultimate##0-->L19: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[81] L19-->L21-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" [2025-04-26 16:21:48,023 INFO L754 eck$LassoCheckResult]: Loop: "[83] L21-1-->L21: 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[]" "[85] L21-->L21-1: Formula: (and (= v_i1_9 (+ v_i1_10 1)) (= (+ v_sum1_7 (select v_A_5 v_i1_10)) v_sum1_6)) InVars {sum1=v_sum1_7, A=v_A_5, i1=v_i1_10} OutVars{sum1=v_sum1_6, A=v_A_5, i1=v_i1_9} AuxVars[] AssignedVars[sum1, i1]" [2025-04-26 16:21:48,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 127491, now seen corresponding path program 1 times [2025-04-26 16:21:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:48,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386652154] [2025-04-26 16:21:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:48,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:48,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:48,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:48,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:48,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:48,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:48,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:48,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-04-26 16:21:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:48,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437830880] [2025-04-26 16:21:48,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:48,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:48,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:48,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:48,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:48,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:48,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 122521509, now seen corresponding path program 1 times [2025-04-26 16:21:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:48,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648348352] [2025-04-26 16:21:48,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:48,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:48,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:48,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:48,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:48,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:48,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:48,249 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:48,249 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:48,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:48,249 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:48,249 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:48,250 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:48,250 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:48,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:48,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:48,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:48,250 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:48,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,359 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:48,362 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:48,367 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:48,369 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:48,370 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:48,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:48,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:48,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:48,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:48,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:48,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:48,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:48,392 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:48,399 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:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:48,402 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:48,404 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:48,405 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:48,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:48,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:48,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:48,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:48,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:48,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:48,424 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:48,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:48,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:48,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:48,432 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:48,453 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:48,454 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:48,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:48,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:48,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:48,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:48,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:48,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:48,477 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:48,484 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:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:48,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:48,486 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:48,488 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:48,489 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:48,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:48,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:48,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:48,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:48,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:48,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:48,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:48,516 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:48,516 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:48,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:48,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:48,519 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:48,521 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:48,523 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:48,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:21:48,539 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:48,540 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:48,540 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2025-04-26 16:21:48,545 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:48,548 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:48,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:48,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:48,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:48,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:48,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:48,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:48,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:48,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:48,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:48,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:48,630 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:48,663 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:48,666 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 272 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:48,801 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 272 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 650 states and 2226 transitions. Complement of second has 6 states. [2025-04-26 16:21:48,802 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:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-26 16:21:48,811 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:21:48,812 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:48,812 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:21:48,812 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:48,812 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:21:48,812 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:48,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 2226 transitions. [2025-04-26 16:21:48,826 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 146 [2025-04-26 16:21:48,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 462 states and 1591 transitions. [2025-04-26 16:21:48,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2025-04-26 16:21:48,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 364 [2025-04-26 16:21:48,840 INFO L74 IsDeterministic]: Start isDeterministic. Operand 462 states and 1591 transitions. [2025-04-26 16:21:48,841 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:48,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 462 states and 1591 transitions. [2025-04-26 16:21:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states and 1591 transitions. [2025-04-26 16:21:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 367. [2025-04-26 16:21:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 367 states have (on average 3.561307901907357) internal successors, (in total 1307), 366 states have internal predecessors, (1307), 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:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1307 transitions. [2025-04-26 16:21:48,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 367 states and 1307 transitions. [2025-04-26 16:21:48,885 INFO L438 stractBuchiCegarLoop]: Abstraction has 367 states and 1307 transitions. [2025-04-26 16:21:48,885 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:48,885 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 1307 transitions. [2025-04-26 16:21:48,887 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 146 [2025-04-26 16:21:48,888 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:48,888 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:48,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:48,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:48,889 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0]" "[102] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y]" "[86] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2]" "[87] L34-->L36-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2]" [2025-04-26 16:21:48,889 INFO L754 eck$LassoCheckResult]: Loop: "[89] L36-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[]" "[91] L36-->L36-1: Formula: (and (= v_i2_9 (+ v_i2_10 1)) (= (+ (select v_A_7 v_i2_10) v_sum2_7) v_sum2_6)) InVars {A=v_A_7, sum2=v_sum2_7, i2=v_i2_10} OutVars{A=v_A_7, sum2=v_sum2_6, i2=v_i2_9} AuxVars[] AssignedVars[sum2, i2]" [2025-04-26 16:21:48,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 3973605, now seen corresponding path program 1 times [2025-04-26 16:21:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:48,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404740877] [2025-04-26 16:21:48,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:48,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:48,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:48,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:48,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:48,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:48,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:48,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-04-26 16:21:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:48,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461207886] [2025-04-26 16:21:48,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:48,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:48,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:48,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:48,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:48,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:48,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash -476330041, now seen corresponding path program 1 times [2025-04-26 16:21:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:48,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73838923] [2025-04-26 16:21:48,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:48,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:48,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:48,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:48,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:48,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:48,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:48,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:48,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:48,968 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:48,968 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:48,968 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:48,968 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:48,969 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:48,969 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:48,969 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:48,969 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:48,969 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:48,969 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:48,969 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:48,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:48,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:49,051 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:49,051 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:49,053 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:49,055 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:49,057 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:49,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:49,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:49,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:49,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:49,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:49,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:49,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:49,069 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:49,075 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:49,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:49,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:49,077 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:49,078 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:49,079 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:49,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:49,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:49,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:49,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:49,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:49,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:49,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:49,091 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:49,098 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:49,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:49,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:49,103 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:49,104 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:49,106 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:49,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:49,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:49,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:49,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:49,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:49,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:49,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:49,130 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:21:49,130 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:49,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:49,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:49,132 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:49,134 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:49,135 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:49,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:49,154 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:49,154 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:49,154 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 16:21:49,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:49,161 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:49,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:49,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:49,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:49,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:49,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:49,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:49,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:49,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:49,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:49,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:49,209 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:49,210 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:49,210 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 367 states and 1307 transitions. cyclomatic complexity: 1028 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:49,286 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 367 states and 1307 transitions. cyclomatic complexity: 1028. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 959 states and 3662 transitions. Complement of second has 6 states. [2025-04-26 16:21:49,286 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:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-26 16:21:49,287 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:21:49,287 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:49,287 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:21:49,288 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:49,288 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:21:49,288 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:49,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 959 states and 3662 transitions. [2025-04-26 16:21:49,299 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 92 [2025-04-26 16:21:49,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 959 states to 581 states and 2219 transitions. [2025-04-26 16:21:49,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2025-04-26 16:21:49,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2025-04-26 16:21:49,306 INFO L74 IsDeterministic]: Start isDeterministic. Operand 581 states and 2219 transitions. [2025-04-26 16:21:49,306 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:49,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 581 states and 2219 transitions. [2025-04-26 16:21:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 2219 transitions. [2025-04-26 16:21:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 467. [2025-04-26 16:21:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 467 states have (on average 3.8843683083511777) internal successors, (in total 1814), 466 states have internal predecessors, (1814), 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:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1814 transitions. [2025-04-26 16:21:49,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 467 states and 1814 transitions. [2025-04-26 16:21:49,329 INFO L438 stractBuchiCegarLoop]: Abstraction has 467 states and 1814 transitions. [2025-04-26 16:21:49,329 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:49,329 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 467 states and 1814 transitions. [2025-04-26 16:21:49,332 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 92 [2025-04-26 16:21:49,332 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:49,332 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:49,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:49,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:49,333 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0]" "[102] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y]" "[105] L65-->$Ultimate##0: Formula: (and (= 3 v_incThread1of1ForFork2_thidvar1_2) (= 3 v_incThread1of1ForFork2_thidvar2_2) (= 3 v_incThread1of1ForFork2_thidvar0_2)) InVars {} OutVars{incThread1of1ForFork2_thidvar2=v_incThread1of1ForFork2_thidvar2_2, incThread1of1ForFork2_thidvar1=v_incThread1of1ForFork2_thidvar1_2, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_12, incThread1of1ForFork2_thidvar0=v_incThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[incThread1of1ForFork2_thidvar2, incThread1of1ForFork2_thidvar1, incThread1of1ForFork2_j, incThread1of1ForFork2_thidvar0]" "[92] $Ultimate##0-->L50-1: Formula: (= v_incThread1of1ForFork2_j_1 0) InVars {} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_1} AuxVars[] AssignedVars[incThread1of1ForFork2_j]" [2025-04-26 16:21:49,333 INFO L754 eck$LassoCheckResult]: Loop: "[94] L50-1-->L50: Formula: (< v_incThread1of1ForFork2_j_5 v_N_5) InVars {incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5} AuxVars[] AssignedVars[]" "[96] L50-->L50-1: Formula: (or (and (= v_incThread1of1ForFork2_j_8 (+ v_incThread1of1ForFork2_j_7 1)) (< v_incThread1of1ForFork2_j_7 v_i2_17) (= v_A_21 (store v_A_22 v_incThread1of1ForFork2_j_7 (+ 1 (select v_A_22 v_incThread1of1ForFork2_j_7)))) (< v_incThread1of1ForFork2_j_7 v_i1_17)) (and (or (<= v_i2_17 v_incThread1of1ForFork2_j_7) (<= v_i1_17 v_incThread1of1ForFork2_j_7)) (= v_A_21 v_A_22) (= v_incThread1of1ForFork2_j_8 v_incThread1of1ForFork2_j_7))) InVars {A=v_A_22, i1=v_i1_17, i2=v_i2_17, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_7} OutVars{A=v_A_21, i1=v_i1_17, i2=v_i2_17, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_8} AuxVars[] AssignedVars[A, incThread1of1ForFork2_j]" [2025-04-26 16:21:49,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash 3974199, now seen corresponding path program 1 times [2025-04-26 16:21:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:49,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238649338] [2025-04-26 16:21:49,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:49,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:49,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:49,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:49,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:49,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-04-26 16:21:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:49,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323858119] [2025-04-26 16:21:49,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:49,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:49,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:49,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:49,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:49,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash -475759047, now seen corresponding path program 1 times [2025-04-26 16:21:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:49,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081305834] [2025-04-26 16:21:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:49,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:49,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:49,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:49,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:49,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:49,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:49,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:49,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:49,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:49,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,548 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:49 BoogieIcfgContainer [2025-04-26 16:21:49,548 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:49,549 INFO L158 Benchmark]: Toolchain (without parser) took 2035.94ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.4MB in the beginning and 44.0MB in the end (delta: 42.4MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. [2025-04-26 16:21:49,549 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.02ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:49,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.14ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:49,549 INFO L158 Benchmark]: Boogie Preprocessor took 26.61ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 935.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:49,550 INFO L158 Benchmark]: RCFGBuilder took 215.96ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 72.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:49,550 INFO L158 Benchmark]: BuchiAutomizer took 1746.15ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.5MB in the beginning and 44.0MB in the end (delta: 28.5MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. [2025-04-26 16:21:49,551 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 1.02ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.14ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.61ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 935.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 215.96ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 72.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1746.15ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.5MB in the beginning and 44.0MB in the end (delta: 28.5MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 209 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 50 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital31 mio100 ax100 hnf100 lsp81 ukn92 mio100 lsp60 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. The remainder module has 467 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 49]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L64] FORK 0 fork 1 sum1(); [L65] FORK 0 fork 2, 2 sum2(); [L66] FORK 0 fork 3, 3, 3 inc(); [L48] 3 j := 0; VAL [j=0] Loop: [L49] COND TRUE j < N [L51] COND TRUE j < i1 && j < i2 [L52] A[j] := A[j] + 1; [L53] j := j + 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 49]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L64] FORK 0 fork 1 sum1(); [L65] FORK 0 fork 2, 2 sum2(); [L66] FORK 0 fork 3, 3, 3 inc(); [L48] 3 j := 0; VAL [j=0] Loop: [L49] COND TRUE j < N [L51] COND TRUE j < i1 && j < i2 [L52] A[j] := A[j] + 1; [L53] j := j + 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:21:49,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...