/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:20,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:20,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:20,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:20,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:20,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:20,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:20,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:20,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:20,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:20,756 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:20,756 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:20,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:20,757 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:20,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:20,758 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:20,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:20,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:20,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:20,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:20,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:20,758 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:20,758 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:21,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:21,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:21,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:21,014 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:21,015 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:21,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl [2025-04-26 16:21:21,016 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl' [2025-04-26 16:21:21,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:21,034 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:21,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:21,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:21,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:21,042 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 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,066 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 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,072 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:21,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:21,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:21,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:21,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:21,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:21,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:21,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:21,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:21,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:21,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:21,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:21,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:21:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:21:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:21:21,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:21:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:21:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:21:21,151 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:21,151 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:21:21,183 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:21,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:21,254 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:21,255 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:21,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:21,261 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:21,262 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:21 BoogieIcfgContainer [2025-04-26 16:21:21,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:21,262 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:21,262 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:21,266 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:21,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:21,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/2) ... [2025-04-26 16:21:21,268 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7191dc08 and model type map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:21, skipping insertion in model container [2025-04-26 16:21:21,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:21,268 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:21" (2/2) ... [2025-04-26 16:21:21,269 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-incr-split.bpl [2025-04-26 16:21:21,309 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:21,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:21:21,364 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-26 16:21:21,366 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:21,370 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. [2025-04-26 16:21:21,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:21:21,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-26 16:21:21,374 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 21 transitions, 54 flow [2025-04-26 16:21:21,383 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:21,383 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:21,383 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:21,383 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:21,383 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:21,383 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:21,383 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:21,383 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:21,384 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:21,411 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2025-04-26 16:21:21,411 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:21,411 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:21,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:21,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:21,414 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:21,414 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 54 states, but on-demand construction may add more states [2025-04-26 16:21:21,416 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2025-04-26 16:21:21,416 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:21,416 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:21,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:21,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:21,420 INFO L752 eck$LassoCheckResult]: Stem: "[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[]" "[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]" "[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]" "[50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 16:21:21,421 INFO L754 eck$LassoCheckResult]: Loop: "[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[]" "[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]" "[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]" [2025-04-26 16:21:21,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2302668, now seen corresponding path program 1 times [2025-04-26 16:21:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:21,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971003416] [2025-04-26 16:21:21,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:21,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:21,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:21,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:21,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:21,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash 81492, now seen corresponding path program 1 times [2025-04-26 16:21:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:21,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198247671] [2025-04-26 16:21:21,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:21,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:21,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:21,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:21,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:21,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:21,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -120642647, now seen corresponding path program 1 times [2025-04-26 16:21:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:21,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63119004] [2025-04-26 16:21:21,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:21,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:21,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:21,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:21,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:21,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:21,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:21,678 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:21,679 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:21,679 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:21,679 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:21,679 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:21,679 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,680 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:21,680 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:21,680 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:21,680 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:21,681 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:21,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:21,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:21,793 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:21,815 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:21,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:21,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:21,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:21,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:21,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:21,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:21,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:21,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:21,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:21,844 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:21,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:21:21,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:21,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:21,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:21:21,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:21,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:21,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:21,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:21,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:21,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:21,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:21,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:21,872 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:21,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:21,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:21,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:21:21,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:21,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:21,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:21,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:21,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:21,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:21,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:21,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:21,921 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:21,921 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:21:21,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:21,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:21,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:21:21,931 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:21,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:21,949 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:21,949 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:21,950 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 16:21:21,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:21,959 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:21,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:22,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:22,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:22,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:22,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:22,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:22,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:22,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:22,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:22,106 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:22,110 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 54 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:22,200 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 54 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 129 states and 299 transitions. Complement of second has 6 states. [2025-04-26 16:21:22,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:21:22,210 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:21:22,211 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,211 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:21:22,211 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,211 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:21:22,211 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 299 transitions. [2025-04-26 16:21:22,217 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:21:22,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 71 states and 166 transitions. [2025-04-26 16:21:22,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-04-26 16:21:22,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-04-26 16:21:22,223 INFO L74 IsDeterministic]: Start isDeterministic. Operand 71 states and 166 transitions. [2025-04-26 16:21:22,223 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:22,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 166 transitions. [2025-04-26 16:21:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 166 transitions. [2025-04-26 16:21:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2025-04-26 16:21:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.35) internal successors, (in total 141), 59 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 141 transitions. [2025-04-26 16:21:22,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 141 transitions. [2025-04-26 16:21:22,241 INFO L438 stractBuchiCegarLoop]: Abstraction has 60 states and 141 transitions. [2025-04-26 16:21:22,241 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:22,241 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 141 transitions. [2025-04-26 16:21:22,242 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:21:22,242 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:22,242 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:22,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:22,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:22,243 INFO L752 eck$LassoCheckResult]: Stem: "[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[]" "[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]" "[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]" "[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]" "[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]" [2025-04-26 16:21:22,243 INFO L754 eck$LassoCheckResult]: Loop: "[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[]" "[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]" "[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]" [2025-04-26 16:21:22,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 71383291, now seen corresponding path program 1 times [2025-04-26 16:21:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:22,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383982333] [2025-04-26 16:21:22,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:22,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:22,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:22,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:22,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:22,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:22,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:22,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 1 times [2025-04-26 16:21:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:22,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471255655] [2025-04-26 16:21:22,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:22,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:22,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:22,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:22,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:22,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:22,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:22,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash 570868320, now seen corresponding path program 1 times [2025-04-26 16:21:22,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:22,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22458385] [2025-04-26 16:21:22,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:22,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:22,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:22,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:22,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:22,323 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:22,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:22,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:22,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:22,323 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:22,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:22,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:22,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:22,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:22,323 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:22,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,412 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:22,412 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:22,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:22,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:21:22,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:22,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:22,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:22,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:22,430 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:21:22,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:22,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:21:22,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:22,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:22,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:22,454 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:21:22,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:22,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:21:22,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:22,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:22,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:22,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:22,480 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:22,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:22,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:21:22,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:22,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:22,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:22,510 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:22,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,519 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:22,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:21:22,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:22,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:22,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:22,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:22,555 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:21:22,555 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:22,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:22,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:21:22,559 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:22,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:21:22,575 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:22,575 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:22,575 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 2*N Supporting invariants [] [2025-04-26 16:21:22,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:21:22,582 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:22,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:22,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:22,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:22,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:22,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:22,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:22,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:22,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:22,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:22,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:22,643 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:22,643 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 141 transitions. cyclomatic complexity: 91 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:22,691 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 141 transitions. cyclomatic complexity: 91. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 146 states and 359 transitions. Complement of second has 6 states. [2025-04-26 16:21:22,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-04-26 16:21:22,695 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:22,695 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,695 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:22,695 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,696 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:22,696 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 359 transitions. [2025-04-26 16:21:22,698 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:22,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 0 states and 0 transitions. [2025-04-26 16:21:22,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:22,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:22,698 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:22,699 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:22,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:22,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:22,699 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:22,699 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:22,699 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:22,699 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:22,699 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:22,704 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:22 BoogieIcfgContainer [2025-04-26 16:21:22,704 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:22,705 INFO L158 Benchmark]: Toolchain (without parser) took 1670.34ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 69.4MB in the end (delta: 13.4MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:22,705 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:22,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.52ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 81.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:22,705 INFO L158 Benchmark]: Boogie Preprocessor took 22.57ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 80.0MB in the end (delta: 923.6kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:22,705 INFO L158 Benchmark]: RCFGBuilder took 163.07ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 70.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:22,706 INFO L158 Benchmark]: BuchiAutomizer took 1441.85ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 69.4MB in the end (delta: 1.3MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2025-04-26 16:21:22,707 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.20ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.52ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 81.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.57ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 80.0MB in the end (delta: 923.6kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 163.07ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 70.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1441.85ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 69.4MB in the end (delta: 1.3MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 36 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf100 lsp87 ukn70 mio100 lsp89 div100 bol100 ite100 ukn100 eq138 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function 2 * N + -1 * i and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:21:22,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...