/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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:49:46,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:49:46,488 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:46,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:49:46,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:49:46,495 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:46,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:49:46,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:49:46,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:49:46,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:49:46,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:49:46,534 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:49:46,534 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:49:46,535 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:49:46,536 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:49:46,536 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:49:46,536 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:49:46,536 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:49:46,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:49:46,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:49:46,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:49:46,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:49:46,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:49:46,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:49:46,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:49:46,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:49:46,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:49:46,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:49:46,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:49:46,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:49:46,541 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:49:46,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:49:46,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:49:46,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:49:46,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:49:46,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:49:46,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:49:46,542 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:49:46,542 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:46,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:49:46,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:49:46,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:49:46,906 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:49:46,907 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:49:46,908 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.bpl [2024-02-09 23:49:46,908 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log.bpl' [2024-02-09 23:49:46,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:49:46,945 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:49:46,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:46,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:49:46,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:49:46,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,018 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-09 23:49:47,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:47,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:49:47,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:49:47,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:49:47,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:49:47,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:49:47,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:49:47,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:49:47,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:47,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,089 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:47,104 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:47,147 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:49:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:49:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:49:47,148 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-09 23:49:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-09 23:49:47,148 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-09 23:49:47,149 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:47,197 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:49:47,199 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:49:47,283 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:49:47,296 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:49:47,296 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:49:47,298 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:47 BoogieIcfgContainer [2024-02-09 23:49:47,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:49:47,299 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:49:47,299 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:49:47,303 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:49:47,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:47,304 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/2) ... [2024-02-09 23:49:47,305 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2db57f39 and model type array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:49:47, skipping insertion in model container [2024-02-09 23:49:47,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:47,306 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:47" (2/2) ... [2024-02-09 23:49:47,308 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log.bpl [2024-02-09 23:49:47,396 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:49:47,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 88 flow [2024-02-09 23:49:47,448 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-02-09 23:49:47,448 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:47,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 2/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-02-09 23:49:47,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 37 transitions, 88 flow [2024-02-09 23:49:47,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 78 flow [2024-02-09 23:49:47,463 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:49:47,463 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:49:47,463 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:49:47,464 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:49:47,464 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:49:47,464 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:49:47,464 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:49:47,464 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:49:47,465 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 33 transitions, 78 flow [2024-02-09 23:49:47,475 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:47,475 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-02-09 23:49:47,475 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:47,476 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:47,478 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:49:47,479 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 33 transitions, 78 flow [2024-02-09 23:49:47,485 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:47,485 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-02-09 23:49:47,485 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:47,485 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:47,492 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [78] $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] 46#[L54, $Ultimate##0]true [50] $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] 48#[L54, L38]true [51] 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] 50#[L54, L39-1]true [2024-02-09 23:49:47,495 INFO L750 eck$LassoCheckResult]: Loop: 50#[L54, L39-1]true [53] 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[] 53#[L54, L40]true [55] 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] 55#[L54, L41]true [56] 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] 57#[L54, L44]true [57] 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] 59#[L54, L25]true [58] 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] 61#[L25-1, L54]true [59] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 63#[L54, L45]true [60] 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] 65#[L54, L25-2]true [61] 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] 67#[L54, L25-3]true [62] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 50#[L54, L39-1]true [2024-02-09 23:49:47,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 106350, now seen corresponding path program 1 times [2024-02-09 23:49:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286563545] [2024-02-09 23:49:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:47,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -289189928, now seen corresponding path program 1 times [2024-02-09 23:49:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518524208] [2024-02-09 23:49:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:47,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash 6929163, now seen corresponding path program 1 times [2024-02-09 23:49:47,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:47,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739336667] [2024-02-09 23:49:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:47,844 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:47,844 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:47,845 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:47,845 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:47,845 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:47,845 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,845 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:47,845 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:47,846 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:49:47,847 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:47,847 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:47,868 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:47,877 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:47,906 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:47,983 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:47,987 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:47,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,996 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:48,001 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:48,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:48,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:48,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:48,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:48,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:48,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:48,027 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:48,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:48,033 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:48,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:48,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:48,035 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:48,037 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:48,038 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:48,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:48,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:48,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:48,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:48,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:48,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:48,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:48,108 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:48,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:48,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:48,110 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:48,119 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:48,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:48,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:48,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:48,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:48,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:48,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:48,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:48,132 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:48,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:48,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:49:48,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:48,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:48,155 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:48,161 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:48,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:48,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:48,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:48,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:48,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:48,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:48,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:48,174 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:48,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:48,184 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:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:48,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:48,186 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:48,188 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:48,188 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:48,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:48,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:48,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:48,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:48,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:48,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:48,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:48,219 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:49:48,219 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:49:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:48,223 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:48,224 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:48,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:48,233 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:48,234 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:48,234 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:48,240 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:48,247 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:48,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:48,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:48,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:48,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:49:48,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:48,442 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:48,485 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:48,487 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:48,608 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 465 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:48,609 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:48,610 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:48,618 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:48,618 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:48,624 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:48,628 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:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-02-09 23:49:48,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-09 23:49:48,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:48,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-09 23:49:48,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:48,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-09 23:49:48,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:48,635 INFO L428 stractBuchiCegarLoop]: Abstraction has has 56 places, 826 transitions, 3586 flow [2024-02-09 23:49:48,635 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:49:48,635 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 places, 826 transitions, 3586 flow [2024-02-09 23:49:48,785 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:48,786 INFO L124 PetriNetUnfolderBase]: 556/926 cut-off events. [2024-02-09 23:49:48,786 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-02-09 23:49:48,786 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:48,788 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [78] $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] 46#[L54, $Ultimate##0]true [81] 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] 161#[$Ultimate##0, $Ultimate##0, L55]true [63] $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] 163#[L38, $Ultimate##0, L55]true [64] 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] 165#[L39-1, $Ultimate##0, L55]true [66] 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[] 167#[L40, $Ultimate##0, L55]true [68] 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] 169#[L41, $Ultimate##0, L55]true [69] 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] 171#[L44, $Ultimate##0, L55]true [70] 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] 173#[L25, $Ultimate##0, L55]true [71] 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] 175#[L25-1, $Ultimate##0, L55]true [72] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 177#[L45, $Ultimate##0, L55]true [73] 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] 179#[L25-2, $Ultimate##0, L55]true [74] 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] 181#[L25-3, $Ultimate##0, L55]true [75] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 165#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:48,788 INFO L750 eck$LassoCheckResult]: Loop: 165#[L39-1, $Ultimate##0, L55]true [66] 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[] 167#[L40, $Ultimate##0, L55]true [68] 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] 169#[L41, $Ultimate##0, L55]true [69] 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] 171#[L44, $Ultimate##0, L55]true [70] 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] 173#[L25, $Ultimate##0, L55]true [71] 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] 175#[L25-1, $Ultimate##0, L55]true [72] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 177#[L45, $Ultimate##0, L55]true [73] 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] 179#[L25-2, $Ultimate##0, L55]true [74] 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] 181#[L25-3, $Ultimate##0, L55]true [75] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 165#[L39-1, $Ultimate##0, L55]true [66] 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[] 167#[L40, $Ultimate##0, L55]true [68] 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] 169#[L41, $Ultimate##0, L55]true [69] 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] 171#[L44, $Ultimate##0, L55]true [70] 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] 173#[L25, $Ultimate##0, L55]true [71] 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] 175#[L25-1, $Ultimate##0, L55]true [72] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 177#[L45, $Ultimate##0, L55]true [73] 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] 179#[L25-2, $Ultimate##0, L55]true [74] 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] 181#[L25-3, $Ultimate##0, L55]true [75] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 165#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:48,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1118008705, now seen corresponding path program 1 times [2024-02-09 23:49:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:48,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576604873] [2024-02-09 23:49:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:48,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:48,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:48,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1549422721, now seen corresponding path program 1 times [2024-02-09 23:49:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:48,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868740537] [2024-02-09 23:49:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:48,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:48,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:48,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash 270231041, now seen corresponding path program 2 times [2024-02-09 23:49:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973411726] [2024-02-09 23:49:48,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:48,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:48,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:49,123 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:49,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:49,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:49,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:49,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:49,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:49,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:49,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:49,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:49:49,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:49,126 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:49,129 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:49,230 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:49,233 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:49,236 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:49,239 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:49,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:49,244 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:49,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:49:49,373 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:49,373 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:49,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:49,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:49,374 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:49,378 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:49,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:49,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:49,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:49,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:49,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:49,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:49,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:49,389 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:49,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:49,396 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:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:49,398 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:49,404 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:49,413 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:49,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:49,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:49,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:49,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:49,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:49,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:49,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:49,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:49,422 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:49,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:49,423 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:49,429 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:49,431 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:49,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:49,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:49,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:49,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:49,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:49,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:49,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:49,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:49,463 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:49,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:49,465 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:49,474 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:49,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:49,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:49,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:49,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:49,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:49,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:49,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:49,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:49,518 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:49:49,518 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:49:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:49,521 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:49,541 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:49,542 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:49,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-09 23:49:49,566 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:49,566 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:49,566 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:49,573 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:49,576 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:49,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:49,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:49,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:49,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:49:49,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:49,716 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:49,718 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:49,718 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:49,840 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 430 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:49,840 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:49,840 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:49,940 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:49,940 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:49,940 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:49,942 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:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-02-09 23:49:49,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 142 transitions. Stem has 13 letters. Loop has 18 letters. [2024-02-09 23:49:49,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:49,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 142 transitions. Stem has 31 letters. Loop has 18 letters. [2024-02-09 23:49:49,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:49,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 142 transitions. Stem has 13 letters. Loop has 36 letters. [2024-02-09 23:49:49,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:49,949 INFO L428 stractBuchiCegarLoop]: Abstraction has has 72 places, 19096 transitions, 120564 flow [2024-02-09 23:49:49,949 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:49:49,949 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 72 places, 19096 transitions, 120564 flow [2024-02-09 23:49:50,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-09 23:49:54,600 INFO L124 PetriNetUnfolderBase]: 8040/11407 cut-off events. [2024-02-09 23:49:54,600 INFO L125 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2024-02-09 23:49:54,600 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-09 23:49:54,605 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:49:54 BoogieIcfgContainer [2024-02-09 23:49:54,605 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:49:54,609 INFO L158 Benchmark]: Toolchain (without parser) took 7660.66ms. Allocated memory was 251.7MB in the beginning and 893.4MB in the end (delta: 641.7MB). Free memory was 216.6MB in the beginning and 790.6MB in the end (delta: -574.0MB). Peak memory consumption was 562.7MB. Max. memory is 8.0GB. [2024-02-09 23:49:54,609 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 251.7MB. Free memory was 217.7MB in the beginning and 217.5MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:49:54,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.01ms. Allocated memory was 251.7MB in the beginning and 467.7MB in the end (delta: 216.0MB). Free memory was 216.3MB in the beginning and 442.9MB in the end (delta: -226.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-02-09 23:49:54,610 INFO L158 Benchmark]: Boogie Preprocessor took 30.70ms. Allocated memory is still 467.7MB. Free memory was 442.9MB in the beginning and 441.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:49:54,611 INFO L158 Benchmark]: RCFGBuilder took 246.27ms. Allocated memory is still 467.7MB. Free memory was 441.8MB in the beginning and 432.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:49:54,611 INFO L158 Benchmark]: BuchiAutomizer took 7306.37ms. Allocated memory was 467.7MB in the beginning and 893.4MB in the end (delta: 425.7MB). Free memory was 432.2MB in the beginning and 790.6MB in the end (delta: -358.5MB). Peak memory consumption was 563.2MB. Max. memory is 8.0GB. [2024-02-09 23:49:54,613 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.15ms. Allocated memory is still 251.7MB. Free memory was 217.7MB in the beginning and 217.5MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.01ms. Allocated memory was 251.7MB in the beginning and 467.7MB in the end (delta: 216.0MB). Free memory was 216.3MB in the beginning and 442.9MB in the end (delta: -226.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.70ms. Allocated memory is still 467.7MB. Free memory was 442.9MB in the beginning and 441.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 246.27ms. Allocated memory is still 467.7MB. Free memory was 441.8MB in the beginning and 432.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 7306.37ms. Allocated memory was 467.7MB in the beginning and 893.4MB in the end (delta: 425.7MB). Free memory was 432.2MB in the beginning and 790.6MB in the end (delta: -358.5MB). Peak memory consumption was 563.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s 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, 206 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 146 mSDtfsCounter, 178 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: 42ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-09 23:49:54,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...