/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_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:02:32,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:02:32,862 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-10 01:02:32,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:02:32,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:02:32,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:02:32,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:02:32,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:02:32,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:02:32,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:02:32,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:02:32,919 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:02:32,919 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:02:32,920 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:02:32,921 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:02:32,921 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:02:32,921 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:02:32,921 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:02:32,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:02:32,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:02:32,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:02:32,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:02:32,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:02:32,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:02:32,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:02:32,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:02:32,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:02:32,925 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:02:32,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:02:32,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:02:32,926 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:02:32,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:02:32,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:02:32,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:02:32,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:02:32,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:02:32,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:02:32,929 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:02:32,929 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_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:02:33,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:02:33,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:02:33,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:02:33,302 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:02:33,317 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:02:33,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl [2024-02-10 01:02:33,320 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl' [2024-02-10 01:02:33,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:02:33,353 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:02:33,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:33,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:02:33,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:02:33,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,390 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:02:33,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:33,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:02:33,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:02:33,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:02:33,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:02:33,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:02:33,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:02:33,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:02:33,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/1) ... [2024-02-10 01:02:33,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:33,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:33,600 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-10 01:02:33,609 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-10 01:02:33,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2024-02-10 01:02:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2024-02-10 01:02:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2024-02-10 01:02:33,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2024-02-10 01:02:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2024-02-10 01:02:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2024-02-10 01:02:33,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure bank given in one single declaration [2024-02-10 01:02:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure bank [2024-02-10 01:02:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure bank [2024-02-10 01:02:33,657 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:02:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:02:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:02:33,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2024-02-10 01:02:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2024-02-10 01:02:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2024-02-10 01:02:33,659 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:02:33,722 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:02:33,724 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:02:33,862 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:02:33,868 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:02:33,869 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:02:33,871 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:33 BoogieIcfgContainer [2024-02-10 01:02:33,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:02:33,872 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:02:33,872 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:02:33,878 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:02:33,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:33,880 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:33" (1/2) ... [2024-02-10 01:02:33,881 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f2d9984 and model type sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:02:33, skipping insertion in model container [2024-02-10 01:02:33,881 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:33,882 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:33" (2/2) ... [2024-02-10 01:02:33,884 INFO L332 chiAutomizerObserver]: Analyzing ICFG sumsumsampleabs2.bpl [2024-02-10 01:02:34,020 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:02:34,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 102 flow [2024-02-10 01:02:34,096 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2024-02-10 01:02:34,097 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:02:34,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-02-10 01:02:34,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 102 flow [2024-02-10 01:02:34,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 82 flow [2024-02-10 01:02:34,117 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:02:34,118 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:02:34,118 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:02:34,118 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:02:34,118 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:02:34,119 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:02:34,119 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:02:34,119 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:02:34,120 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 32 transitions, 82 flow [2024-02-10 01:02:34,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:34,137 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-02-10 01:02:34,137 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:02:34,137 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:34,143 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:02:34,144 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 32 transitions, 82 flow [2024-02-10 01:02:34,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:34,156 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-02-10 01:02:34,156 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:02:34,156 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:34,171 INFO L748 eck$LassoCheckResult]: Stem: 50#[$Ultimate##0]true [101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0] 52#[$Ultimate##0, L68]true [104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x] 54#[$Ultimate##0, $Ultimate##0, L69]true [76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1] 56#[$Ultimate##0, L69, L22]true [77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1] 58#[L23-1, $Ultimate##0, L69]true [2024-02-10 01:02:34,172 INFO L750 eck$LassoCheckResult]: Loop: 58#[L23-1, $Ultimate##0, L69]true [79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[] 61#[$Ultimate##0, L69, L24]true [81] L24-->L25: Formula: (= (+ v_sum1_3 (let ((.cse0 (select v_A_1 v_i1_3))) (ite (< .cse0 0) (- .cse0) .cse0))) v_sum1_2) InVars {sum1=v_sum1_3, A=v_A_1, i1=v_i1_3} OutVars{sum1=v_sum1_2, A=v_A_1, i1=v_i1_3} AuxVars[] AssignedVars[sum1] 63#[L25, $Ultimate##0, L69]true [82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1] 58#[L23-1, $Ultimate##0, L69]true [2024-02-10 01:02:34,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash 4034789, now seen corresponding path program 1 times [2024-02-10 01:02:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663640826] [2024-02-10 01:02:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:34,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash 108303, now seen corresponding path program 1 times [2024-02-10 01:02:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15724728] [2024-02-10 01:02:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:34,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash -58606677, now seen corresponding path program 1 times [2024-02-10 01:02:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782964502] [2024-02-10 01:02:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:34,581 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:34,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:34,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:34,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:34,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:34,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:34,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:34,583 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:34,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:02:34,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:34,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:34,607 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-10 01:02:34,620 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-10 01:02:34,626 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-10 01:02:34,629 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-10 01:02:34,633 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-10 01:02:34,869 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:34,873 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:34,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:34,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:34,879 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-10 01:02:34,885 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-10 01:02:34,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:34,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:34,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:34,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:34,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:34,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:34,913 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-10 01:02:34,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:34,939 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-10 01:02:34,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:34,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:34,945 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-10 01:02:34,947 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-10 01:02:34,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:34,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:34,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:34,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:34,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:34,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:34,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:34,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:34,988 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-10 01:02:34,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:34,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:34,991 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-10 01:02:34,993 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-10 01:02:34,995 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-10 01:02:35,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:35,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:35,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:35,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:35,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:35,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:35,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:35,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:35,023 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-10 01:02:35,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:35,025 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-10 01:02:35,035 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-10 01:02:35,036 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-10 01:02:35,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:35,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:35,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:35,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:35,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:35,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:35,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:35,071 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-10 01:02:35,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:35,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:35,074 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-10 01:02:35,075 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-10 01:02:35,077 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-10 01:02:35,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:35,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:35,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:35,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:35,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:35,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:35,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:35,120 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:02:35,120 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:02:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:35,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:35,123 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10 01:02:35,133 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:35,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:02:35,157 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:35,158 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:35,159 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-10 01:02:35,167 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-10 01:02:35,170 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:35,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:35,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:35,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:35,245 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:02:35,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:35,290 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-10 01:02:35,339 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-10 01:02:35,342 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10 01:02:35,531 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 states and 509 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:35,533 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:35,533 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:35,534 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:02:35,563 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:02:35,563 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:02:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10 01:02:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-02-10 01:02:35,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 197 transitions. Stem has 4 letters. Loop has 3 letters. [2024-02-10 01:02:35,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:35,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 197 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-10 01:02:35,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:35,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 197 transitions. Stem has 4 letters. Loop has 6 letters. [2024-02-10 01:02:35,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:35,583 INFO L428 stractBuchiCegarLoop]: Abstraction has has 51 places, 405 transitions, 1854 flow [2024-02-10 01:02:35,583 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:02:35,584 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 places, 405 transitions, 1854 flow [2024-02-10 01:02:35,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:35,698 INFO L124 PetriNetUnfolderBase]: 497/634 cut-off events. [2024-02-10 01:02:35,698 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-02-10 01:02:35,698 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:35,699 INFO L748 eck$LassoCheckResult]: Stem: 50#[$Ultimate##0]true [101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0] 52#[$Ultimate##0, L68]true [104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x] 54#[$Ultimate##0, $Ultimate##0, L69]true [107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y] 124#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L70]true [110] L70-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j] 126#[$Ultimate##0, $Ultimate##0, L71, $Ultimate##0, $Ultimate##0]true [93] $Ultimate##0-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 128#[$Ultimate##0, L57-1, $Ultimate##0, L71, $Ultimate##0]true [95] L57-1-->L58: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_5) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} AuxVars[] AssignedVars[] 130#[L58, $Ultimate##0, $Ultimate##0, L71, $Ultimate##0]true [97] L58-->L59: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 132#[$Ultimate##0, L59, $Ultimate##0, L71, $Ultimate##0]true [98] L59-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 128#[$Ultimate##0, L57-1, $Ultimate##0, L71, $Ultimate##0]true [2024-02-10 01:02:35,699 INFO L750 eck$LassoCheckResult]: Loop: 128#[$Ultimate##0, L57-1, $Ultimate##0, L71, $Ultimate##0]true [95] L57-1-->L58: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_5) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} AuxVars[] AssignedVars[] 130#[L58, $Ultimate##0, $Ultimate##0, L71, $Ultimate##0]true [97] L58-->L59: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 132#[$Ultimate##0, L59, $Ultimate##0, L71, $Ultimate##0]true [98] L59-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 128#[$Ultimate##0, L57-1, $Ultimate##0, L71, $Ultimate##0]true [2024-02-10 01:02:35,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -898396022, now seen corresponding path program 1 times [2024-02-10 01:02:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424634836] [2024-02-10 01:02:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:35,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 124191, now seen corresponding path program 1 times [2024-02-10 01:02:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:35,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502617339] [2024-02-10 01:02:35,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:35,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:35,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2120391670, now seen corresponding path program 2 times [2024-02-10 01:02:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138833399] [2024-02-10 01:02:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:35,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:36,044 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:36,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:36,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:36,045 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:36,045 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:36,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:36,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:36,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:02:36,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:36,045 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:36,051 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-10 01:02:36,054 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-10 01:02:36,059 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-10 01:02:36,112 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-10 01:02:36,115 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-10 01:02:36,118 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-10 01:02:36,120 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-10 01:02:36,123 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-10 01:02:36,125 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-10 01:02:36,128 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-10 01:02:36,130 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-10 01:02:36,132 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-10 01:02:36,135 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-10 01:02:36,279 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:36,279 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:36,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,281 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10 01:02:36,292 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-10 01:02:36,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:36,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:36,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:36,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:36,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:36,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:36,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:02:36,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:36,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 01:02:36,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,325 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10 01:02:36,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:36,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:36,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:36,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:36,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:36,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:36,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:36,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:02:36,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:36,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:36,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,364 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10 01:02:36,371 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-10 01:02:36,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:36,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:36,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:36,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:36,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:36,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:02:36,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:36,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:36,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:36,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:36,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,410 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10 01:02:36,419 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-10 01:02:36,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:36,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:36,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:36,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:36,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:02:36,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:36,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:36,452 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:36,461 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:02:36,461 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 01:02:36,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,463 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10 01:02:36,469 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:36,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 01:02:36,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:36,498 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:36,498 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2024-02-10 01:02:36,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:36,507 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:36,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:36,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:36,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:36,553 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:02:36,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:36,586 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-10 01:02:36,587 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-10 01:02:36,588 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 01:02:36,718 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 9 states and 504 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:36,718 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:36,718 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 01:02:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 01:02:36,738 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:02:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 504 transitions. [2024-02-10 01:02:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 504 transitions. [2024-02-10 01:02:36,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:37,031 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:02:37,032 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:02:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 01:02:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-02-10 01:02:37,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 01:02:37,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:37,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 11 letters. Loop has 3 letters. [2024-02-10 01:02:37,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:37,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 8 letters. Loop has 6 letters. [2024-02-10 01:02:37,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:37,036 INFO L428 stractBuchiCegarLoop]: Abstraction has has 64 places, 6586 transitions, 43221 flow [2024-02-10 01:02:37,036 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:02:37,037 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 places, 6586 transitions, 43221 flow [2024-02-10 01:02:37,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:37,727 INFO L124 PetriNetUnfolderBase]: 2985/3492 cut-off events. [2024-02-10 01:02:37,727 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2024-02-10 01:02:37,727 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:37,728 INFO L748 eck$LassoCheckResult]: Stem: 50#[$Ultimate##0]true [101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0] 52#[$Ultimate##0, L68]true [104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x] 54#[$Ultimate##0, $Ultimate##0, L69]true [107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y] 124#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L70]true [83] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2] 205#[$Ultimate##0, $Ultimate##0, L34, L70]true [84] L34-->L35-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2] 207#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [86] L35-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[] 209#[$Ultimate##0, $Ultimate##0, L36, L70]true [88] L36-->L37: Formula: (= (+ (let ((.cse0 (select v_A_2 v_i2_2))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_2) v_sum2_1) InVars {A=v_A_2, sum2=v_sum2_2, i2=v_i2_2} OutVars{A=v_A_2, sum2=v_sum2_1, i2=v_i2_2} AuxVars[] AssignedVars[sum2] 211#[$Ultimate##0, L37, $Ultimate##0, L70]true [89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2] 207#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [2024-02-10 01:02:37,728 INFO L750 eck$LassoCheckResult]: Loop: 207#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [86] L35-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[] 209#[$Ultimate##0, $Ultimate##0, L36, L70]true [88] L36-->L37: Formula: (= (+ (let ((.cse0 (select v_A_2 v_i2_2))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_2) v_sum2_1) InVars {A=v_A_2, sum2=v_sum2_2, i2=v_i2_2} OutVars{A=v_A_2, sum2=v_sum2_1, i2=v_i2_2} AuxVars[] AssignedVars[sum2] 211#[$Ultimate##0, L37, $Ultimate##0, L70]true [89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2] 207#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [86] L35-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[] 209#[$Ultimate##0, $Ultimate##0, L36, L70]true [88] L36-->L37: Formula: (= (+ (let ((.cse0 (select v_A_2 v_i2_2))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_2) v_sum2_1) InVars {A=v_A_2, sum2=v_sum2_2, i2=v_i2_2} OutVars{A=v_A_2, sum2=v_sum2_1, i2=v_i2_2} AuxVars[] AssignedVars[sum2] 211#[$Ultimate##0, L37, $Ultimate##0, L70]true [89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2] 207#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [2024-02-10 01:02:37,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash -923608145, now seen corresponding path program 1 times [2024-02-10 01:02:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671143032] [2024-02-10 01:02:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:37,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash -861349919, now seen corresponding path program 1 times [2024-02-10 01:02:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382303328] [2024-02-10 01:02:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:37,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2126006001, now seen corresponding path program 2 times [2024-02-10 01:02:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271322117] [2024-02-10 01:02:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:38,088 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:38,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:38,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:38,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:38,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:38,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:38,089 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:38,089 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:02:38,089 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:38,089 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:38,098 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-10 01:02:38,101 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-10 01:02:38,104 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-10 01:02:38,237 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-10 01:02:38,241 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-10 01:02:38,243 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-10 01:02:38,246 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-10 01:02:38,249 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-10 01:02:38,251 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-10 01:02:38,505 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:38,506 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,508 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10 01:02:38,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 01:02:38,521 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-10 01:02:38,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:38,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:38,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:38,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:38,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:38,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,554 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10 01:02:38,565 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-10 01:02:38,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:38,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:38,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:38,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 01:02:38,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:38,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,592 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10 01:02:38,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:38,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:38,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 01:02:38,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:38,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:38,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:38,647 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:02:38,647 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-10 01:02:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,653 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10 01:02:38,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:38,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 01:02:38,678 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:38,678 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:38,678 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2024-02-10 01:02:38,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:38,692 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:02:38,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:38,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:38,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:38,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:38,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:02:38,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:02:38,804 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:02:38,804 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-10 01:02:38,881 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 8 states and 471 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:38,881 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:38,881 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 471 transitions. [2024-02-10 01:02:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 471 transitions. [2024-02-10 01:02:38,885 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:02:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 471 transitions. [2024-02-10 01:02:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 471 transitions. [2024-02-10 01:02:42,530 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:02:42,531 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:42,531 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-10 01:02:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-10 01:02:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2024-02-10 01:02:42,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 157 transitions. Stem has 8 letters. Loop has 6 letters. [2024-02-10 01:02:42,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:42,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 157 transitions. Stem has 14 letters. Loop has 6 letters. [2024-02-10 01:02:42,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:42,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 157 transitions. Stem has 8 letters. Loop has 12 letters. [2024-02-10 01:02:42,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:42,534 INFO L428 stractBuchiCegarLoop]: Abstraction has has 76 places, 102503 transitions, 879304 flow [2024-02-10 01:02:42,534 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:02:42,534 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 places, 102503 transitions, 879304 flow Received shutdown request... [2024-02-10 01:07:01,399 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:07:01,609 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:07:01,615 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:07:01 BoogieIcfgContainer [2024-02-10 01:07:01,615 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:07:01,615 INFO L158 Benchmark]: Toolchain (without parser) took 268262.41ms. Allocated memory was 162.5MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 130.4MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2024-02-10 01:07:01,616 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.16ms. Allocated memory is still 162.5MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:07:01,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.87ms. Allocated memory is still 162.5MB. Free memory was 130.4MB in the beginning and 128.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:07:01,616 INFO L158 Benchmark]: Boogie Preprocessor took 62.80ms. Allocated memory was 162.5MB in the beginning and 246.4MB in the end (delta: 83.9MB). Free memory was 128.8MB in the beginning and 220.4MB in the end (delta: -91.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:07:01,617 INFO L158 Benchmark]: RCFGBuilder took 413.23ms. Allocated memory is still 246.4MB. Free memory was 220.2MB in the beginning and 209.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:07:01,617 INFO L158 Benchmark]: BuchiAutomizer took 267742.43ms. Allocated memory was 246.4MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 209.2MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2024-02-10 01:07:01,619 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.16ms. Allocated memory is still 162.5MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.87ms. Allocated memory is still 162.5MB. Free memory was 130.4MB in the beginning and 128.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.80ms. Allocated memory was 162.5MB in the beginning and 246.4MB in the end (delta: 83.9MB). Free memory was 128.8MB in the beginning and 220.4MB in the end (delta: -91.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 413.23ms. Allocated memory is still 246.4MB. Free memory was 220.2MB in the beginning and 209.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 267742.43ms. Allocated memory was 246.4MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 209.2MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 3.5GB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. The remainder module has 879304 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 267.5s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 4.6s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 219 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 254 mSDtfsCounter, 243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf100 lsp220 ukn30 mio100 lsp68 div100 bol100 ite100 ukn100 eq156 hnf99 smp100 dnf210 smp47 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms 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 - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2024-02-10 01:07:01,633 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