/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:25:15,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:25:15,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:25:15,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:25:15,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:25:15,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:25:15,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:25:15,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:25:15,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:25:15,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:25:15,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:25:15,550 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:25:15,550 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:25:15,551 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:25:15,551 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:25:15,551 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:25:15,552 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:25:15,552 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:25:15,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:25:15,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:25:15,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:25:15,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:25:15,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:25:15,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:25:15,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:25:15,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:25:15,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:25:15,562 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:25:15,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:25:15,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:25:15,562 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:25:15,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:25:15,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:25:15,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:25:15,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:25:15,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:25:15,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:25:15,564 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:25:15,565 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2024-02-09 23:25:15,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:25:15,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:25:15,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:25:15,919 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:25:15,920 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:25:15,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl [2024-02-09 23:25:15,922 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl' [2024-02-09 23:25:15,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:25:15,943 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:25:15,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:25:15,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:25:15,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:25:15,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:15,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:15,978 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:25:15,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:25:16,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:25:16,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:25:16,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:25:16,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:25:16,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:25:16,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:25:16,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:25:16,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/1) ... [2024-02-09 23:25:16,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:16,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:16,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:16,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:25:16,130 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2024-02-09 23:25:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2024-02-09 23:25:16,130 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2024-02-09 23:25:16,131 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2024-02-09 23:25:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2024-02-09 23:25:16,131 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2024-02-09 23:25:16,132 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:25:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:25:16,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:25:16,132 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2024-02-09 23:25:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2024-02-09 23:25:16,133 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2024-02-09 23:25:16,133 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:25:16,187 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:25:16,189 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:25:16,292 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:25:16,321 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:25:16,322 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:25:16,324 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:25:16 BoogieIcfgContainer [2024-02-09 23:25:16,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:25:16,325 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:25:16,325 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:25:16,330 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:25:16,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:25:16,331 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:25:15" (1/2) ... [2024-02-09 23:25:16,333 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14fc3646 and model type sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:25:16, skipping insertion in model container [2024-02-09 23:25:16,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:25:16,333 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:25:16" (2/2) ... [2024-02-09 23:25:16,335 INFO L332 chiAutomizerObserver]: Analyzing ICFG sumsuminc.bpl [2024-02-09 23:25:16,404 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:25:16,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 80 flow [2024-02-09 23:25:16,446 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-02-09 23:25:16,447 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:25:16,451 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 48 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. [2024-02-09 23:25:16,451 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 80 flow [2024-02-09 23:25:16,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 65 flow [2024-02-09 23:25:16,465 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:25:16,465 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:25:16,465 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:25:16,466 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:25:16,466 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:25:16,466 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:25:16,466 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:25:16,466 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:25:16,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:25:16,566 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 180 [2024-02-09 23:25:16,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:16,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:16,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:25:16,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:25:16,570 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:25:16,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 272 states, but on-demand construction may add more states [2024-02-09 23:25:16,588 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 180 [2024-02-09 23:25:16,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:16,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:16,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-02-09 23:25:16,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:25:16,594 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]don't care [95] $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] 41#[$Ultimate##0, L64]don't care [76] $Ultimate##0-->L19: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1] 45#[L64, L19]don't care [77] L19-->L21-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1] 53#[L21-1, L64]don't care [2024-02-09 23:25:16,595 INFO L750 eck$LassoCheckResult]: Loop: 53#[L21-1, L64]don't care [79] 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[] 69#[L21, L64]don't care [81] L21-->L21-1: Formula: (and (= (+ v_i1_12 1) v_i1_11) (= v_sum1_6 (+ (select v_A_15 v_i1_12) v_sum1_7))) InVars {sum1=v_sum1_7, A=v_A_15, i1=v_i1_12} OutVars{sum1=v_sum1_6, A=v_A_15, i1=v_i1_11} AuxVars[] AssignedVars[sum1, i1] 53#[L21-1, L64]don't care [2024-02-09 23:25:16,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash 123519, now seen corresponding path program 1 times [2024-02-09 23:25:16,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:16,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220021237] [2024-02-09 23:25:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:16,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:16,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:16,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash 3491, now seen corresponding path program 1 times [2024-02-09 23:25:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261633934] [2024-02-09 23:25:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:16,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:16,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:16,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 118704289, now seen corresponding path program 1 times [2024-02-09 23:25:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261961715] [2024-02-09 23:25:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:16,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:16,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:16,814 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:16,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:16,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:16,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:16,815 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:16,816 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:16,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:16,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:16,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:25:16,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:16,816 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:16,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:16,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:16,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:16,945 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:16,949 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:16,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:16,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:16,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:25:16,958 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 [2024-02-09 23:25:16,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:16,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:16,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:16,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:16,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:16,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:17,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:17,007 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-09 23:25:17,008 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-09 23:25:17,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:17,016 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:17,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:25:17,027 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:17,050 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:25:17,051 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:17,052 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-09 23:25:17,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:17,059 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:25:17,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:17,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:25:17,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:17,113 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:25:17,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:17,163 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 [2024-02-09 23:25:17,165 INFO L71 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, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:17,320 INFO L75 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, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 650 states and 2226 transitions. Complement of second has 6 states. [2024-02-09 23:25:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-02-09 23:25:17,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-09 23:25:17,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:17,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-09 23:25:17,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:17,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-09 23:25:17,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:17,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 2226 transitions. [2024-02-09 23:25:17,364 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 146 [2024-02-09 23:25:17,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 462 states and 1591 transitions. [2024-02-09 23:25:17,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2024-02-09 23:25:17,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 364 [2024-02-09 23:25:17,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 462 states and 1591 transitions. [2024-02-09 23:25:17,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:17,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 462 states and 1591 transitions. [2024-02-09 23:25:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states and 1591 transitions. [2024-02-09 23:25:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 367. [2024-02-09 23:25:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 367 states have (on average 3.561307901907357) internal successors, (1307), 366 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1307 transitions. [2024-02-09 23:25:17,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 367 states and 1307 transitions. [2024-02-09 23:25:17,462 INFO L428 stractBuchiCegarLoop]: Abstraction has 367 states and 1307 transitions. [2024-02-09 23:25:17,462 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:25:17,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 1307 transitions. [2024-02-09 23:25:17,466 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 146 [2024-02-09 23:25:17,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:17,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:17,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-02-09 23:25:17,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:25:17,468 INFO L748 eck$LassoCheckResult]: Stem: 1910#[$Ultimate##0]don't care [95] $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] 1912#[$Ultimate##0, L64]don't care [98] 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] 1988#[$Ultimate##0, L65, $Ultimate##0]don't care [82] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2] 1894#[L34, $Ultimate##0, L65]don't care [83] L34-->L36-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2] 1896#[$Ultimate##0, L65, L36-1]don't care [2024-02-09 23:25:17,468 INFO L750 eck$LassoCheckResult]: Loop: 1896#[$Ultimate##0, L65, L36-1]don't care [85] 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[] 1924#[L36, $Ultimate##0, L65]don't care [87] L36-->L36-1: Formula: (and (= (+ v_i2_12 1) v_i2_11) (= (+ (select v_A_13 v_i2_12) v_sum2_7) v_sum2_6)) InVars {A=v_A_13, sum2=v_sum2_7, i2=v_i2_12} OutVars{A=v_A_13, sum2=v_sum2_6, i2=v_i2_11} AuxVars[] AssignedVars[sum2, i2] 1896#[$Ultimate##0, L65, L36-1]don't care [2024-02-09 23:25:17,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 3850469, now seen corresponding path program 1 times [2024-02-09 23:25:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939828983] [2024-02-09 23:25:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:17,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:17,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:17,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2024-02-09 23:25:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:17,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184971077] [2024-02-09 23:25:17,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:17,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:17,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:17,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:17,488 INFO L85 PathProgramCache]: Analyzing trace with hash -594663865, now seen corresponding path program 1 times [2024-02-09 23:25:17,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:17,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249070114] [2024-02-09 23:25:17,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:17,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:17,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:17,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:17,576 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:25:17,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:25:17,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:25:17,577 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:25:17,577 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:25:17,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:17,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:25:17,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:25:17,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:25:17,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:25:17,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:25:17,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:17,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:17,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:17,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:17,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:17,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:25:17,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:17,709 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:25:17,709 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:25:17,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:17,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:17,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:17,721 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 [2024-02-09 23:25:17,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:17,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:25:17,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:17,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:17,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:17,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:25:17,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:25:17,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:25:17,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:25:17,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:17,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:17,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:17,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:17,754 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 [2024-02-09 23:25:17,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:25:17,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:25:17,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:25:17,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:25:17,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:25:17,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:25:17,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:25:17,779 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:25:17,784 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:25:17,784 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:25:17,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:25:17,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:25:17,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:25:17,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:25:17,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:25:17,814 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:25:17,815 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:25:17,815 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2024-02-09 23:25:17,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:17,821 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:25:17,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:17,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:25:17,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:25:17,855 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:25:17,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:25:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:25:17,876 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 [2024-02-09 23:25:17,876 INFO L71 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, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:17,972 INFO L75 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, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 959 states and 3662 transitions. Complement of second has 6 states. [2024-02-09 23:25:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-02-09 23:25:17,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 4 letters. Loop has 2 letters. [2024-02-09 23:25:17,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:17,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 6 letters. Loop has 2 letters. [2024-02-09 23:25:17,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:17,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-09 23:25:17,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:17,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 959 states and 3662 transitions. [2024-02-09 23:25:17,988 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 92 [2024-02-09 23:25:17,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 959 states to 581 states and 2219 transitions. [2024-02-09 23:25:17,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2024-02-09 23:25:17,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2024-02-09 23:25:17,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 2219 transitions. [2024-02-09 23:25:17,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:17,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 581 states and 2219 transitions. [2024-02-09 23:25:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 2219 transitions. [2024-02-09 23:25:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 467. [2024-02-09 23:25:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 467 states have (on average 3.8843683083511777) internal successors, (1814), 466 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1814 transitions. [2024-02-09 23:25:18,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 467 states and 1814 transitions. [2024-02-09 23:25:18,041 INFO L428 stractBuchiCegarLoop]: Abstraction has 467 states and 1814 transitions. [2024-02-09 23:25:18,041 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:25:18,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 467 states and 1814 transitions. [2024-02-09 23:25:18,045 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 92 [2024-02-09 23:25:18,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:18,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:18,046 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-02-09 23:25:18,046 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:25:18,046 INFO L748 eck$LassoCheckResult]: Stem: 3265#[$Ultimate##0]don't care [95] $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] 3267#[$Ultimate##0, L64]don't care [98] 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] 3665#[$Ultimate##0, L65, $Ultimate##0]don't care [101] 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] 3651#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L66]don't care [88] $Ultimate##0-->L51-1: Formula: (= v_incThread1of1ForFork2_j_1 0) InVars {} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_1} AuxVars[] AssignedVars[incThread1of1ForFork2_j] 3419#[$Ultimate##0, $Ultimate##0, L66, L51-1]don't care [2024-02-09 23:25:18,047 INFO L750 eck$LassoCheckResult]: Loop: 3419#[$Ultimate##0, $Ultimate##0, L66, L51-1]don't care [90] L51-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[] 3423#[$Ultimate##0, $Ultimate##0, L66, L50]don't care [92] L50-->L51-1: Formula: (or (and (= v_A_In_1 v_A_Out_2) (or (<= v_i1_In_1 v_incThread1of1ForFork2_j_7) (<= v_i2_In_1 v_incThread1of1ForFork2_j_7)) (= v_incThread1of1ForFork2_j_8 v_incThread1of1ForFork2_j_7)) (and (< v_incThread1of1ForFork2_j_7 v_i2_In_1) (< v_incThread1of1ForFork2_j_7 v_i1_In_1) (= v_incThread1of1ForFork2_j_8 (+ v_incThread1of1ForFork2_j_7 1)) (= v_A_Out_2 (store v_A_In_1 v_incThread1of1ForFork2_j_7 (+ (select v_A_In_1 v_incThread1of1ForFork2_j_7) 1))))) InVars {A=v_A_In_1, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_7} OutVars{A=v_A_Out_2, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_8} AuxVars[] AssignedVars[A, incThread1of1ForFork2_j] 3419#[$Ultimate##0, $Ultimate##0, L66, L51-1]don't care [2024-02-09 23:25:18,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash 3851063, now seen corresponding path program 1 times [2024-02-09 23:25:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:18,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736897100] [2024-02-09 23:25:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:18,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2024-02-09 23:25:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:18,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720182194] [2024-02-09 23:25:18,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:18,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash -594092871, now seen corresponding path program 1 times [2024-02-09 23:25:18,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:18,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653935130] [2024-02-09 23:25:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:18,311 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:25:18 BoogieIcfgContainer [2024-02-09 23:25:18,312 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:25:18,316 INFO L158 Benchmark]: Toolchain (without parser) took 2368.81ms. Allocated memory was 165.7MB in the beginning and 265.3MB in the end (delta: 99.6MB). Free memory was 135.7MB in the beginning and 181.9MB in the end (delta: -46.2MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2024-02-09 23:25:18,316 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 165.7MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:25:18,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.61ms. Allocated memory was 165.7MB in the beginning and 265.3MB in the end (delta: 99.6MB). Free memory was 135.7MB in the beginning and 237.8MB in the end (delta: -102.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:25:18,318 INFO L158 Benchmark]: Boogie Preprocessor took 18.67ms. Allocated memory is still 265.3MB. Free memory was 239.5MB in the beginning and 238.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:25:18,318 INFO L158 Benchmark]: RCFGBuilder took 299.08ms. Allocated memory is still 265.3MB. Free memory was 238.5MB in the beginning and 227.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-09 23:25:18,319 INFO L158 Benchmark]: BuchiAutomizer took 1986.77ms. Allocated memory is still 265.3MB. Free memory was 227.0MB in the beginning and 181.9MB in the end (delta: 45.0MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. [2024-02-09 23:25:18,324 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.12ms. Allocated memory is still 165.7MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.61ms. Allocated memory was 165.7MB in the beginning and 265.3MB in the end (delta: 99.6MB). Free memory was 135.7MB in the beginning and 237.8MB in the end (delta: -102.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.67ms. Allocated memory is still 265.3MB. Free memory was 239.5MB in the beginning and 238.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 299.08ms. Allocated memory is still 265.3MB. Free memory was 238.5MB in the beginning and 227.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1986.77ms. Allocated memory is still 265.3MB. Free memory was 227.0MB in the beginning and 181.9MB in the end (delta: 45.0MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: sat Degree: 0 Time: 101ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - 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 FALSE !(j < i1 && j < i2) 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 FALSE !(j < i1 && j < i2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:25:18,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-09 23:25:18,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...