/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 false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:34:34,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:34:34,910 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:34:34,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:34:34,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:34:34,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:34:34,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:34:34,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:34:34,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:34:34,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:34:34,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:34:34,969 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:34:34,970 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:34:34,970 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:34:34,970 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:34:34,970 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:34:34,971 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:34:34,971 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:34:34,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:34:34,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:34:34,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:34:34,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:34:34,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:34:34,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:34:34,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:34:34,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:34:34,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:34:34,975 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:34:34,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:34:34,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:34:34,977 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:34:34,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:34:34,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:34:34,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:34:34,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:34:34,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:34:34,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:34:34,978 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:34:34,978 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 -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:34:35,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:34:35,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:34:35,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:34:35,351 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:34:35,353 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:34:35,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl [2024-02-10 01:34:35,354 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl' [2024-02-10 01:34:35,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:34:35,392 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:34:35,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:34:35,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:34:35,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:34:35,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,453 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:34:35,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:34:35,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:34:35,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:34:35,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:34:35,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:34:35,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:34:35,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:34:35,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:34:35,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/1) ... [2024-02-10 01:34:35,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:35,556 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:34:35,577 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:34:35,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 01:34:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:34:35,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:34:35,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 01:34:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:34:35,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:34:35,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:34:35,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:34:35,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:34:35,611 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:34:35,666 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:34:35,668 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:34:35,806 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:34:35,814 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:34:35,815 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:34:35,816 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:34:35 BoogieIcfgContainer [2024-02-10 01:34:35,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:34:35,817 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:34:35,818 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:34:35,823 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:34:35,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:34:35,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:35" (1/2) ... [2024-02-10 01:34:35,825 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ea68403 and model type map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:34:35, skipping insertion in model container [2024-02-10 01:34:35,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:34:35,826 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:34:35" (2/2) ... [2024-02-10 01:34:35,827 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-incr-split.bpl [2024-02-10 01:34:35,893 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:34:35,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2024-02-10 01:34:35,958 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2024-02-10 01:34:35,958 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:34:35,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2024-02-10 01:34:35,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2024-02-10 01:34:35,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2024-02-10 01:34:35,978 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:34:35,978 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:34:35,979 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:34:35,979 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:34:35,979 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:34:35,979 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:34:35,979 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:34:35,980 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:34:35,980 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:35,981 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 26 places, 21 transitions, 54 flow [2024-02-10 01:34:36,005 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 54 states have internal predecessors, (103), 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:34:36,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 54 states have internal predecessors, (103), 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:34:36,037 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2024-02-10 01:34:36,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:36,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:36,042 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:34:36,043 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:36,044 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 26 places, 21 transitions, 54 flow [2024-02-10 01:34:36,055 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 54 states have internal predecessors, (103), 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:34:36,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 54 states have internal predecessors, (103), 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:34:36,063 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2024-02-10 01:34:36,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:36,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:36,069 INFO L748 eck$LassoCheckResult]: Stem: Black: 143#[$Ultimate##0]don't care [45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[] 146#[L17]don't care [38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] 148#[L19]don't care [64] L19-->$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] 150#[$Ultimate##0, L19-1]don't care [50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 152#[L33-1, L19-1]don't care [2024-02-10 01:34:36,071 INFO L750 eck$LassoCheckResult]: Loop: 152#[L33-1, L19-1]don't care [52] L33-1-->L34: 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[] 160#[L34, L19-1]don't care [54] L34-->L35: 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] 172#[L19-1, L35]don't care [55] L35-->L33-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] 152#[L33-1, L19-1]don't care [2024-02-10 01:34:36,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:36,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2302668, now seen corresponding path program 1 times [2024-02-10 01:34:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176948622] [2024-02-10 01:34:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:36,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:36,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:36,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash 81492, now seen corresponding path program 1 times [2024-02-10 01:34:36,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:36,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393330093] [2024-02-10 01:34:36,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:36,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:36,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:36,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:36,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:36,274 INFO L85 PathProgramCache]: Analyzing trace with hash -120642647, now seen corresponding path program 1 times [2024-02-10 01:34:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:36,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59184746] [2024-02-10 01:34:36,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:36,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:36,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:36,474 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:34:36,475 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:34:36,475 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:34:36,475 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:34:36,476 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:34:36,476 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:36,476 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:34:36,476 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:34:36,476 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:34:36,476 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:34:36,476 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:34:36,497 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:34:36,510 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:34:36,643 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:34:36,647 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:34:36,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:36,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:36,655 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:34:36,658 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:34:36,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:36,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:36,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:36,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:36,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:36,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:36,683 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:34:36,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:36,709 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:34:36,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:36,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:36,713 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:34:36,719 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:34:36,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:36,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:34:36,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:36,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:36,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:36,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:34:36,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:34:36,732 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:34:36,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:36,751 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:34:36,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:36,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:36,753 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:34:36,760 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:34:36,768 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:34:36,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:36,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:36,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:36,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:36,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:36,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:36,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:34:36,811 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:34:36,811 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:34:36,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:36,816 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:34:36,820 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:34:36,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:34:36,843 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:34:36,843 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:34:36,844 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2024-02-10 01:34:36,852 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:34:36,855 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:34:36,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:36,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:34:36,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:36,927 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:34:36,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:36,975 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:34:37,009 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:34:37,011 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:34:37,174 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 309 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:34:37,175 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:34:37,176 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:34:37,182 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:34:37,182 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:34:37,188 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:34:37,193 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:34:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-02-10 01:34:37,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 4 letters. Loop has 3 letters. [2024-02-10 01:34:37,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:37,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-10 01:34:37,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:37,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 119 transitions. Stem has 4 letters. Loop has 6 letters. [2024-02-10 01:34:37,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:37,197 INFO L428 stractBuchiCegarLoop]: Abstraction has has 44 places, 514 transitions, 2338 flow [2024-02-10 01:34:37,197 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:34:37,197 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:37,197 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 44 places, 514 transitions, 2338 flow [2024-02-10 01:34:37,220 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 163 states, 153 states have (on average 2.549019607843137) internal successors, (390), 162 states have internal predecessors, (390), 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:34:37,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 163 states, 153 states have (on average 2.549019607843137) internal successors, (390), 162 states have internal predecessors, (390), 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:34:37,233 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 42 [2024-02-10 01:34:37,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:37,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:37,235 INFO L748 eck$LassoCheckResult]: Stem: Black: 309#[$Ultimate##0]don't care [45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[] 312#[L17]don't care [38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x] Black: 317#[L19]don't care [64] L19-->$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] 325#[$Ultimate##0, L19-1]don't care [67] L19-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] Black: 333#[$Ultimate##0, $Ultimate##0, L20]don't care [56] $Ultimate##0-->L45-1: Formula: (= v_N_4 v_thread2Thread1of1ForFork1_i_1) InVars {N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1, N=v_N_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 344#[$Ultimate##0, L45-1, L20]don't care [2024-02-10 01:34:37,236 INFO L750 eck$LassoCheckResult]: Loop: 344#[$Ultimate##0, L45-1, L20]don't care [58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[] Black: 373#[$Ultimate##0, L46, L20]don't care [60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) 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] 431#[$Ultimate##0, L47, L20]don't care [61] L47-->L45-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] Black: 346#[$Ultimate##0, L45-1, L20]don't care [58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[] 378#[$Ultimate##0, L46, L20]don't care [60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) 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] Black: 436#[$Ultimate##0, L47, L20]don't care [61] L47-->L45-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] 344#[$Ultimate##0, L45-1, L20]don't care [2024-02-10 01:34:37,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash 71383291, now seen corresponding path program 1 times [2024-02-10 01:34:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316500795] [2024-02-10 01:34:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:37,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:37,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:37,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1689686687, now seen corresponding path program 1 times [2024-02-10 01:34:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032652287] [2024-02-10 01:34:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:37,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:37,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:37,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1332313381, now seen corresponding path program 1 times [2024-02-10 01:34:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16280660] [2024-02-10 01:34:37,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:37,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:37,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:37,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 01:34:37,441 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:34:37,441 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:34:37,441 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:34:37,441 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:34:37,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:34:37,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:37,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:34:37,442 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:34:37,442 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:34:37,442 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:34:37,442 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:34:37,445 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:34:37,447 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:34:37,469 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:34:37,522 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:34:37,527 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:34:37,621 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:34:37,622 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:34:37,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:37,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:37,625 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:34:37,630 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:34:37,631 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:34:37,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:37,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:34:37,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:37,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:37,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:37,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:34:37,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:34:37,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:37,660 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:34:37,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:37,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:37,665 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:34:37,671 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:34:37,677 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:34:37,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:37,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:37,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:37,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:37,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:37,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:37,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:37,705 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:34:37,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:37,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:37,706 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:34:37,708 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:34:37,709 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:34:37,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:37,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:34:37,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:37,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:37,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:37,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:34:37,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:34:37,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:37,734 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 01:34:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:37,739 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:34:37,740 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:34:37,742 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:34:37,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:37,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:37,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:37,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:37,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:37,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:37,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:34:37,803 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:34:37,804 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 01:34:37,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:37,809 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:34:37,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:34:37,827 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:34:37,833 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:34:37,833 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:34:37,834 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 2*N Supporting invariants [] [2024-02-10 01:34:37,844 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:34:37,849 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:34:37,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:37,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:34:37,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:37,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:34:37,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:37,969 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:34:37,970 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:34:37,970 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:34:38,079 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 8 states and 286 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:34:38,080 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:34:38,080 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:34:38,151 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:34:38,151 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:34:38,152 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:34:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:34:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-02-10 01:34:38,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 01:34:38,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:38,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 11 letters. Loop has 6 letters. [2024-02-10 01:34:38,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:38,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 5 letters. Loop has 12 letters. [2024-02-10 01:34:38,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:38,155 INFO L428 stractBuchiCegarLoop]: Abstraction has has 60 places, 11608 transitions, 75636 flow [2024-02-10 01:34:38,155 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:34:38,155 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:38,155 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 60 places, 11608 transitions, 75636 flow [2024-02-10 01:34:38,596 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:34:38,900 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 638 states, 569 states have (on average 3.4200351493848857) internal successors, (1946), 637 states have internal predecessors, (1946), 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:34:38,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 638 states, 569 states have (on average 3.4200351493848857) internal successors, (1946), 637 states have internal predecessors, (1946), 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:34:38,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 01:34:38,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 01:34:38,936 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:34:38 BoogieIcfgContainer [2024-02-10 01:34:38,936 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:34:38,937 INFO L158 Benchmark]: Toolchain (without parser) took 3544.79ms. Allocated memory was 157.3MB in the beginning and 244.3MB in the end (delta: 87.0MB). Free memory was 99.6MB in the beginning and 177.3MB in the end (delta: -77.7MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. [2024-02-10 01:34:38,937 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 157.3MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:34:38,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.72ms. Allocated memory is still 157.3MB. Free memory was 99.4MB in the beginning and 133.5MB in the end (delta: -34.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2024-02-10 01:34:38,938 INFO L158 Benchmark]: Boogie Preprocessor took 47.42ms. Allocated memory is still 157.3MB. Free memory was 133.5MB in the beginning and 132.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:34:38,938 INFO L158 Benchmark]: RCFGBuilder took 302.72ms. Allocated memory is still 157.3MB. Free memory was 132.5MB in the beginning and 123.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-02-10 01:34:38,939 INFO L158 Benchmark]: BuchiAutomizer took 3118.42ms. Allocated memory was 157.3MB in the beginning and 244.3MB in the end (delta: 87.0MB). Free memory was 122.8MB in the beginning and 177.3MB in the end (delta: -54.5MB). Peak memory consumption was 164.3MB. Max. memory is 8.0GB. [2024-02-10 01:34:38,941 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 157.3MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.72ms. Allocated memory is still 157.3MB. Free memory was 99.4MB in the beginning and 133.5MB in the end (delta: -34.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.42ms. Allocated memory is still 157.3MB. Free memory was 133.5MB in the beginning and 132.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 302.72ms. Allocated memory is still 157.3MB. Free memory was 132.5MB in the beginning and 123.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3118.42ms. Allocated memory was 157.3MB in the beginning and 244.3MB in the end (delta: 87.0MB). Free memory was 122.8MB in the beginning and 177.3MB in the end (delta: -54.5MB). Peak memory consumption was 164.3MB. 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 2 * N + -1 * i and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 94 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp89 ukn59 mio100 lsp89 div100 bol100 ite100 ukn100 eq139 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms 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 01:34:38,971 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...