/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 -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-4threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:49:40,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:49:40,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:49:40,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:49:40,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:49:40,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:49:40,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:49:40,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:49:40,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:49:40,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:49:40,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:49:40,750 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:49:40,751 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:49:40,751 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:49:40,751 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:49:40,751 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:49:40,751 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:49:40,751 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:49:40,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:49:40,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:49:40,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:49:40,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:49:40,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:49:40,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:49:40,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:49:40,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:49:40,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:49:40,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:49:40,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:49:40,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:49:40,755 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:49:40,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:49:40,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:49:40,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:49:40,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:49:40,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:49:40,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:49:40,756 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:49:40,757 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 [2024-02-09 23:49:41,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:49:41,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:49:41,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:49:41,046 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:49:41,053 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:49:41,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-4threads.bpl [2024-02-09 23:49:41,055 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-4threads.bpl' [2024-02-09 23:49:41,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:49:41,073 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:49:41,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:41,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:49:41,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:49:41,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,099 INFO L138 Inliner]: procedures = 3, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-09 23:49:41,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:41,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:49:41,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:49:41,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:49:41,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:49:41,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:49:41,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:49:41,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:49:41,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/1) ... [2024-02-09 23:49:41,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:41,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:41,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:41,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:49:41,240 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:49:41,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:49:41,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:49:41,241 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-09 23:49:41,241 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-09 23:49:41,241 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-09 23:49:41,242 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:49:41,286 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:49:41,288 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:49:41,373 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:49:41,387 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:49:41,387 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:49:41,388 INFO L201 PluginConnector]: Adding new model array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:41 BoogieIcfgContainer [2024-02-09 23:49:41,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:49:41,389 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:49:41,389 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:49:41,392 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:49:41,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:41,392 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:41" (1/2) ... [2024-02-09 23:49:41,394 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dff9809 and model type array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:49:41, skipping insertion in model container [2024-02-09 23:49:41,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:41,394 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:41" (2/2) ... [2024-02-09 23:49:41,395 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-4threads.bpl [2024-02-09 23:49:41,471 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-09 23:49:41,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 71 transitions, 170 flow [2024-02-09 23:49:41,526 INFO L124 PetriNetUnfolderBase]: 4/63 cut-off events. [2024-02-09 23:49:41,527 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-09 23:49:41,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 63 events. 4/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 200 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-02-09 23:49:41,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 71 transitions, 170 flow [2024-02-09 23:49:41,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 63 transitions, 150 flow [2024-02-09 23:49:41,541 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:49:41,541 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:49:41,541 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:49:41,541 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:49:41,541 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:49:41,541 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:49:41,541 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:49:41,541 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:49:41,542 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 72 places, 63 transitions, 150 flow [2024-02-09 23:49:41,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:41,557 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2024-02-09 23:49:41,557 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:41,557 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:41,561 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:49:41,562 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 72 places, 63 transitions, 150 flow [2024-02-09 23:49:41,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:41,570 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2024-02-09 23:49:41,570 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:41,570 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:41,574 INFO L748 eck$LassoCheckResult]: Stem: 80#[$Ultimate##0]true [112] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 82#[L54, $Ultimate##0]true [58] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 84#[L54, L38]true [59] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 86#[L54, L39-1]true [2024-02-09 23:49:41,575 INFO L750 eck$LassoCheckResult]: Loop: 86#[L54, L39-1]true [61] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_1) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[] 89#[L54, L40]true [63] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 91#[L54, L41]true [64] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 93#[L54, L44]true [65] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 95#[L54, L25]true [66] L25-->L25-1: Formula: (and (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork0_log_msg#1_3|)) (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 97#[L25-1, L54]true [67] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 99#[L54, L45]true [68] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_7| |v_sumThread1of1ForFork0_x#1_7|) InVars {sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 101#[L54, L25-2]true [69] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork0_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 103#[L54, L25-3]true [70] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 86#[L54, L39-1]true [2024-02-09 23:49:41,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash 139280, now seen corresponding path program 1 times [2024-02-09 23:49:41,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:41,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159793352] [2024-02-09 23:49:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:41,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:41,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2059580448, now seen corresponding path program 1 times [2024-02-09 23:49:41,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:41,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930590663] [2024-02-09 23:49:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:41,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash -437465935, now seen corresponding path program 1 times [2024-02-09 23:49:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956845871] [2024-02-09 23:49:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:41,853 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:41,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:41,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:41,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:41,854 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:41,854 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:41,854 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:41,854 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:41,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-4threads.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:49:41,855 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:41,855 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:41,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:41,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:41,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:41,961 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:41,964 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:41,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:41,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:41,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:49:41,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:42,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:42,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:42,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:42,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-09 23:49:42,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:42,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:49:42,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:42,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:42,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:42,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:42,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-09 23:49:42,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:42,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:49:42,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:42,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:42,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:42,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:42,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:42,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-09 23:49:42,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:42,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:49:42,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:42,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:42,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:42,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:42,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:42,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:49:42,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:42,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:49:42,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:42,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:42,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:42,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:42,246 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:49:42,246 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:49:42,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,250 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-09 23:49:42,251 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:42,259 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-09 23:49:42,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:42,269 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:42,270 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2024-02-09 23:49:42,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-09 23:49:42,286 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:42,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:42,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:42,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:42,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:49:42,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:49:42,435 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-09 23:49:42,438 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:49:42,654 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 907 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:42,655 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:42,656 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:42,671 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:42,671 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:42,675 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-09 23:49:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:49:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 349 transitions. [2024-02-09 23:49:42,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 349 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-09 23:49:42,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:42,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 349 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-09 23:49:42,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:42,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 349 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-09 23:49:42,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:42,686 INFO L428 stractBuchiCegarLoop]: Abstraction has has 90 places, 1606 transitions, 7018 flow [2024-02-09 23:49:42,686 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:49:42,686 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 90 places, 1606 transitions, 7018 flow [2024-02-09 23:49:42,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-09 23:49:45,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:45,323 INFO L124 PetriNetUnfolderBase]: 18727/23204 cut-off events. [2024-02-09 23:49:45,323 INFO L125 PetriNetUnfolderBase]: For 1757/1757 co-relation queries the response was YES. [2024-02-09 23:49:45,324 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:45,326 INFO L748 eck$LassoCheckResult]: Stem: 80#[$Ultimate##0]true [112] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 82#[L54, $Ultimate##0]true [115] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1] 197#[$Ultimate##0, $Ultimate##0, L55]true [84] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 199#[L38, $Ultimate##0, L55]true [85] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 201#[L39-1, $Ultimate##0, L55]true [87] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 203#[L40, $Ultimate##0, L55]true [89] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 205#[L41, $Ultimate##0, L55]true [90] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 207#[$Ultimate##0, L44, L55]true [91] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 209#[L25, $Ultimate##0, L55]true [92] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 211#[L25-1, $Ultimate##0, L55]true [93] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 213#[L45, $Ultimate##0, L55]true [94] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 215#[L25-2, $Ultimate##0, L55]true [95] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 217#[L25-3, $Ultimate##0, L55]true [96] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 201#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:45,326 INFO L750 eck$LassoCheckResult]: Loop: 201#[L39-1, $Ultimate##0, L55]true [87] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 203#[L40, $Ultimate##0, L55]true [89] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 205#[L41, $Ultimate##0, L55]true [90] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 207#[$Ultimate##0, L44, L55]true [91] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 209#[L25, $Ultimate##0, L55]true [92] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 211#[L25-1, $Ultimate##0, L55]true [93] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 213#[L45, $Ultimate##0, L55]true [94] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 215#[L25-2, $Ultimate##0, L55]true [95] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 217#[L25-3, $Ultimate##0, L55]true [96] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 201#[L39-1, $Ultimate##0, L55]true [87] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 203#[L40, $Ultimate##0, L55]true [89] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 205#[L41, $Ultimate##0, L55]true [90] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 207#[$Ultimate##0, L44, L55]true [91] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 209#[L25, $Ultimate##0, L55]true [92] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 211#[L25-1, $Ultimate##0, L55]true [93] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 213#[L45, $Ultimate##0, L55]true [94] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 215#[L25-2, $Ultimate##0, L55]true [95] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 217#[L25-3, $Ultimate##0, L55]true [96] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 201#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:45,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1634431030, now seen corresponding path program 1 times [2024-02-09 23:49:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:45,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397801196] [2024-02-09 23:49:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:45,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:45,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:45,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 528795681, now seen corresponding path program 1 times [2024-02-09 23:49:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344985154] [2024-02-09 23:49:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:45,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:45,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:45,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 993686806, now seen corresponding path program 2 times [2024-02-09 23:49:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:45,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794132508] [2024-02-09 23:49:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:45,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:45,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:45,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:45,676 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:45,676 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:45,676 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:45,676 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:45,676 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:45,676 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:45,676 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:45,676 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:45,676 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-4threads.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:49:45,676 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:45,676 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:45,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:45,896 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:45,897 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:45,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:45,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:45,913 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-09 23:49:45,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:45,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:45,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:45,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:45,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:45,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:45,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:45,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:45,952 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-09 23:49:45,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:45,965 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-09 23:49:45,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:45,985 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-09 23:49:45,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:45,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:45,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:45,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:45,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:45,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:45,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:45,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:46,000 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-09 23:49:46,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:46,021 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-09 23:49:46,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:46,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:46,037 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-09 23:49:46,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:46,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:46,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:46,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:46,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:46,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:46,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:46,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:46,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:46,058 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-09 23:49:46,060 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-09 23:49:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:46,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:46,063 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:46,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-09 23:49:46,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:46,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:46,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:46,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:46,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:46,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:46,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:46,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:46,119 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:49:46,119 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:49:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:46,133 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:49:46,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:46,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-09 23:49:46,153 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:46,153 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:46,154 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2024-02-09 23:49:46,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-09 23:49:46,161 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:46,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:46,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:46,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:46,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:49:46,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:49:46,310 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:49:46,310 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:49:46,431 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 838 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:46,431 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:46,431 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:46,598 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:46,599 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:49:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:49:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2024-02-09 23:49:46,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 278 transitions. Stem has 13 letters. Loop has 18 letters. [2024-02-09 23:49:46,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:46,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 278 transitions. Stem has 31 letters. Loop has 18 letters. [2024-02-09 23:49:46,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:46,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 278 transitions. Stem has 13 letters. Loop has 36 letters. [2024-02-09 23:49:46,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:46,603 INFO L428 stractBuchiCegarLoop]: Abstraction has has 106 places, 37816 transitions, 240372 flow [2024-02-09 23:49:46,603 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:49:46,603 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 places, 37816 transitions, 240372 flow [2024-02-09 23:49:47,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 Received shutdown request... [2024-02-09 23:54:12,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-09 23:54:12,373 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-09 23:54:12,378 INFO L201 PluginConnector]: Adding new model array-sum-with-log-4threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:54:12 BoogieIcfgContainer [2024-02-09 23:54:12,378 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:54:12,379 INFO L158 Benchmark]: Toolchain (without parser) took 271305.05ms. Allocated memory was 159.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 105.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2024-02-09 23:54:12,379 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory was 106.5MB in the beginning and 106.3MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:54:12,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.78ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 103.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:54:12,379 INFO L158 Benchmark]: Boogie Preprocessor took 62.76ms. Allocated memory is still 159.4MB. Free memory was 103.3MB in the beginning and 139.6MB in the end (delta: -36.3MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2024-02-09 23:54:12,380 INFO L158 Benchmark]: RCFGBuilder took 223.90ms. Allocated memory is still 159.4MB. Free memory was 139.5MB in the beginning and 129.9MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:54:12,380 INFO L158 Benchmark]: BuchiAutomizer took 270989.01ms. Allocated memory was 159.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 129.7MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2024-02-09 23:54:12,381 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory was 106.5MB in the beginning and 106.3MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.78ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 103.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.76ms. Allocated memory is still 159.4MB. Free memory was 103.3MB in the beginning and 139.6MB in the end (delta: -36.3MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * RCFGBuilder took 223.90ms. Allocated memory is still 159.4MB. Free memory was 139.5MB in the beginning and 129.9MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 270989.01ms. Allocated memory was 159.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 129.7MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. The remainder module has 240372 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 270.8s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/9 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 544 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 286 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital67 mio100 ax100 hnf100 lsp91 ukn61 mio100 lsp47 div100 bol100 ite100 ukn100 eq193 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown