/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/map-incr-decr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:59:13,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:59:13,136 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 00:59:13,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:59:13,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:59:13,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:59:13,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:59:13,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:59:13,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:59:13,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:59:13,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:59:13,195 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:59:13,195 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:59:13,196 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:59:13,196 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:59:13,197 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:59:13,197 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:59:13,197 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:59:13,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:59:13,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:59:13,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:59:13,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:59:13,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:59:13,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:59:13,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:59:13,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:59:13,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:59:13,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:59:13,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:59:13,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:59:13,201 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:59:13,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:59:13,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:59:13,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:59:13,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:59:13,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:59:13,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:59:13,202 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:59:13,202 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 00:59:13,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:59:13,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:59:13,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:59:13,791 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:59:13,797 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:59:13,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl [2024-02-10 00:59:13,800 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl' [2024-02-10 00:59:13,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:59:13,832 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:59:13,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:59:13,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:59:13,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:59:13,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,933 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:59:13,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:59:13,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:59:13,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:59:13,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:59:13,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:59:13,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:59:13,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:59:13,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:59:13,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/1) ... [2024-02-10 00:59:13,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:14,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:14,024 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 00:59:14,058 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 00:59:14,098 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:59:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:59:14,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:59:14,099 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:59:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:59:14,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:59:14,100 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:59:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:59:14,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:59:14,101 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 00:59:14,155 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:59:14,157 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:59:14,334 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:59:14,340 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:59:14,340 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:59:14,341 INFO L201 PluginConnector]: Adding new model map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:59:14 BoogieIcfgContainer [2024-02-10 00:59:14,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:59:14,342 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:59:14,342 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:59:14,365 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:59:14,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:59:14,366 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:13" (1/2) ... [2024-02-10 00:59:14,368 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c2f82a3 and model type map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:59:14, skipping insertion in model container [2024-02-10 00:59:14,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:59:14,369 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:59:14" (2/2) ... [2024-02-10 00:59:14,370 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-incr-decr.bpl [2024-02-10 00:59:14,505 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:59:14,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2024-02-10 00:59:14,582 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2024-02-10 00:59:14,582 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:59:14,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2024-02-10 00:59:14,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2024-02-10 00:59:14,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 22 transitions, 56 flow [2024-02-10 00:59:14,614 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:59:14,614 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:59:14,615 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:59:14,615 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:59:14,615 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:59:14,615 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:59:14,615 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:59:14,616 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:59:14,616 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 places, 22 transitions, 56 flow [2024-02-10 00:59:14,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:14,641 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-10 00:59:14,641 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:59:14,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:14,646 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:59:14,647 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 places, 22 transitions, 56 flow [2024-02-10 00:59:14,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:14,655 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-10 00:59:14,655 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:59:14,655 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:14,661 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]true [43] $Ultimate##0-->L17: Formula: (= v_B_1 v_A_5) InVars {A=v_A_5} OutVars{A=v_A_5, B=v_B_1} AuxVars[] AssignedVars[B] 35#[L17]true [35] L17-->L18: Formula: (and (<= 0 v_k_1) (< v_k_1 v_N_5)) InVars {k=v_k_1, N=v_N_5} OutVars{k=v_k_1, N=v_N_5} AuxVars[] AssignedVars[] 37#[L18]true [37] L18-->L20: Formula: (= (select v_A_6 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_6, k=v_k_2} OutVars{A=v_A_6, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] 39#[L20]true [66] L20-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 41#[$Ultimate##0, L20-1]true [52] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 43#[L34-1, L20-1]true [2024-02-10 00:59:14,668 INFO L750 eck$LassoCheckResult]: Loop: 43#[L34-1, L20-1]true [54] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[] 46#[L20-1, L35]true [56] L35-->L37: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A] 48#[L37, L20-1]true [57] L37-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 43#[L34-1, L20-1]true [2024-02-10 00:59:14,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash 69420894, now seen corresponding path program 1 times [2024-02-10 00:59:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:14,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141271945] [2024-02-10 00:59:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:14,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:14,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:14,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:14,911 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2024-02-10 00:59:14,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:14,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390351632] [2024-02-10 00:59:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:14,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:14,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:14,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:14,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2056329831, now seen corresponding path program 1 times [2024-02-10 00:59:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924485661] [2024-02-10 00:59:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:14,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:14,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:15,201 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:15,202 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:15,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:15,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:15,202 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:15,202 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:15,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:15,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:15,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-decr.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:59:15,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:15,203 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:15,220 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 00:59:15,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 00:59:15,412 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:15,416 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:15,436 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 00:59:15,475 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 00:59:15,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:15,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:15,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:15,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:15,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:15,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:15,493 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 00:59:15,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:15,523 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 00:59:15,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:15,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:15,527 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 00:59:15,572 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 00:59:15,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:15,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:15,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:15,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:15,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:15,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:15,616 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 00:59:15,628 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:15,643 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:59:15,644 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:59:15,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:15,660 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 00:59:15,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:15,691 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 00:59:15,706 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:59:15,707 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:15,707 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 00:59:15,713 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 00:59:15,716 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:59:15,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:15,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:15,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:15,808 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:59:15,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:15,839 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 00:59:15,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 00:59:15,931 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 00:59:15,934 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:59:16,122 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 322 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:16,123 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:16,123 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:16,124 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:59:16,157 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:59:16,158 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:16,177 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 00:59:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:59:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-02-10 00:59:16,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 5 letters. Loop has 3 letters. [2024-02-10 00:59:16,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:16,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 8 letters. Loop has 3 letters. [2024-02-10 00:59:16,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:16,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 00:59:16,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:16,209 INFO L428 stractBuchiCegarLoop]: Abstraction has has 36 places, 270 transitions, 1221 flow [2024-02-10 00:59:16,209 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:59:16,209 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 270 transitions, 1221 flow [2024-02-10 00:59:16,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:16,266 INFO L124 PetriNetUnfolderBase]: 95/146 cut-off events. [2024-02-10 00:59:16,266 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-10 00:59:16,266 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:16,267 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]true [43] $Ultimate##0-->L17: Formula: (= v_B_1 v_A_5) InVars {A=v_A_5} OutVars{A=v_A_5, B=v_B_1} AuxVars[] AssignedVars[B] 35#[L17]true [35] L17-->L18: Formula: (and (<= 0 v_k_1) (< v_k_1 v_N_5)) InVars {k=v_k_1, N=v_N_5} OutVars{k=v_k_1, N=v_N_5} AuxVars[] AssignedVars[] 37#[L18]true [37] L18-->L20: Formula: (= (select v_A_6 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_6, k=v_k_2} OutVars{A=v_A_6, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] 39#[L20]true [66] L20-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 41#[$Ultimate##0, L20-1]true [69] L20-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 115#[$Ultimate##0, L21, $Ultimate##0]true [58] $Ultimate##0-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 117#[L21, $Ultimate##0, L47-1]true [60] L47-1-->L48: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[] 119#[L21, $Ultimate##0, L48]true [62] L48-->L50: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (- 1) (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 121#[L50, L21, $Ultimate##0]true [63] L50-->L47-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 117#[L21, $Ultimate##0, L47-1]true [2024-02-10 00:59:16,267 INFO L750 eck$LassoCheckResult]: Loop: 117#[L21, $Ultimate##0, L47-1]true [60] L47-1-->L48: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[] 119#[L21, $Ultimate##0, L48]true [62] L48-->L50: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (- 1) (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A] 121#[L50, L21, $Ultimate##0]true [63] L50-->L47-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 117#[L21, $Ultimate##0, L47-1]true [2024-02-10 00:59:16,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:16,267 INFO L85 PathProgramCache]: Analyzing trace with hash 694107762, now seen corresponding path program 1 times [2024-02-10 00:59:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:16,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382893037] [2024-02-10 00:59:16,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:16,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:16,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:16,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash 89436, now seen corresponding path program 1 times [2024-02-10 00:59:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937050532] [2024-02-10 00:59:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:16,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:16,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:16,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2103132853, now seen corresponding path program 2 times [2024-02-10 00:59:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423054074] [2024-02-10 00:59:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:16,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:16,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:16,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:16,569 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:16,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:16,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:16,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:16,570 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:16,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:16,570 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:16,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:16,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-decr.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:59:16,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:16,570 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:16,572 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 00:59:16,574 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 00:59:16,577 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 00:59:16,634 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 00:59:16,637 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 00:59:16,750 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:16,750 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:16,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:16,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:16,752 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 00:59:16,795 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 00:59:16,796 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 00:59:16,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:16,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:16,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:16,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:16,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:16,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:16,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:16,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:16,848 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 00:59:16,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:16,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:16,865 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 00:59:16,887 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 00:59:16,898 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 00:59:16,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:16,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:16,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:16,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:16,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:16,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:16,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:16,945 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 00:59:16,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:16,951 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 00:59:16,959 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 00:59:16,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:16,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:16,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:16,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:16,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:16,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:17,008 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 00:59:17,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:17,034 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:59:17,035 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 00:59:17,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:17,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:17,036 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 00:59:17,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:17,073 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 00:59:17,094 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:59:17,094 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:17,094 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2024-02-10 00:59:17,102 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 00:59:17,103 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:59:17,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:17,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:17,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:17,167 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:59:17,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:17,206 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 00:59:17,208 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 00:59:17,208 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 00:59:17,370 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 322 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:17,370 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:17,370 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 322 transitions. [2024-02-10 00:59:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2024-02-10 00:59:17,391 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:59:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 322 transitions. [2024-02-10 00:59:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2024-02-10 00:59:17,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:17,698 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:59:17,699 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:17,700 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 00:59:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 00:59:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-02-10 00:59:17,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 9 letters. Loop has 3 letters. [2024-02-10 00:59:17,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:17,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 12 letters. Loop has 3 letters. [2024-02-10 00:59:17,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:17,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 9 letters. Loop has 6 letters. [2024-02-10 00:59:17,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:17,703 INFO L428 stractBuchiCegarLoop]: Abstraction has has 49 places, 4291 transitions, 27870 flow [2024-02-10 00:59:17,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:59:17,703 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 places, 4291 transitions, 27870 flow [2024-02-10 00:59:18,680 INFO L124 PetriNetUnfolderBase]: 1248/1738 cut-off events. [2024-02-10 00:59:18,682 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2024-02-10 00:59:18,682 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 00:59:18,691 INFO L201 PluginConnector]: Adding new model map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:59:18 BoogieIcfgContainer [2024-02-10 00:59:18,700 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:59:18,702 INFO L158 Benchmark]: Toolchain (without parser) took 4869.14ms. Allocated memory was 176.2MB in the beginning and 227.5MB in the end (delta: 51.4MB). Free memory was 142.0MB in the beginning and 117.6MB in the end (delta: 24.3MB). Peak memory consumption was 133.0MB. Max. memory is 8.0GB. [2024-02-10 00:59:18,702 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.38ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:59:18,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.98ms. Allocated memory is still 176.2MB. Free memory was 142.0MB in the beginning and 150.8MB in the end (delta: -8.9MB). Peak memory consumption was 4.1MB. Max. memory is 8.0GB. [2024-02-10 00:59:18,712 INFO L158 Benchmark]: Boogie Preprocessor took 37.82ms. Allocated memory is still 176.2MB. Free memory was 150.8MB in the beginning and 149.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:59:18,712 INFO L158 Benchmark]: RCFGBuilder took 356.18ms. Allocated memory is still 176.2MB. Free memory was 149.8MB in the beginning and 140.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-02-10 00:59:18,713 INFO L158 Benchmark]: BuchiAutomizer took 4358.03ms. Allocated memory was 176.2MB in the beginning and 227.5MB in the end (delta: 51.4MB). Free memory was 140.6MB in the beginning and 117.6MB in the end (delta: 22.9MB). Peak memory consumption was 132.0MB. Max. memory is 8.0GB. [2024-02-10 00:59:18,717 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.38ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 109.98ms. Allocated memory is still 176.2MB. Free memory was 142.0MB in the beginning and 150.8MB in the end (delta: -8.9MB). Peak memory consumption was 4.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.82ms. Allocated memory is still 176.2MB. Free memory was 150.8MB in the beginning and 149.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 356.18ms. Allocated memory is still 176.2MB. Free memory was 149.8MB in the beginning and 140.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4358.03ms. Allocated memory was 176.2MB in the beginning and 227.5MB in the end (delta: 51.4MB). Free memory was 140.6MB in the beginning and 117.6MB in the end (delta: 22.9MB). Peak memory consumption was 132.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 104 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital52 mio100 ax100 hnf100 lsp89 ukn71 mio100 lsp70 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 82ms 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 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 00:59:18,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...