/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-5threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:59,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:59,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:59,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:59,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:59,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:59,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:59,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:59,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:59,433 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:59,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:59,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:59,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:59,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:59,434 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:59,434 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:59,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:59,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:59,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:59,685 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:59,686 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:59,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-5threads.bpl [2025-04-26 16:20:59,689 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-5threads.bpl' [2025-04-26 16:20:59,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:59,707 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:59,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:59,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:59,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:59,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,744 INFO L138 Inliner]: procedures = 3, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-04-26 16:20:59,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:59,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:59,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:59,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:59,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:59,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:59,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:59,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:59,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/1) ... [2025-04-26 16:20:59,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:59,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:59,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:59,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:59,815 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:59,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:59,816 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:20:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:20:59,816 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:20:59,816 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:59,855 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:59,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:59,938 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:59,938 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:59,950 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:59,950 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:59,950 INFO L201 PluginConnector]: Adding new model array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:59 BoogieIcfgContainer [2025-04-26 16:20:59,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:59,951 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:59,951 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:59,955 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:59,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:59,955 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:59" (1/2) ... [2025-04-26 16:20:59,956 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c0ede97 and model type array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:59, skipping insertion in model container [2025-04-26 16:20:59,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:59,956 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:59" (2/2) ... [2025-04-26 16:20:59,957 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-5threads.bpl [2025-04-26 16:21:00,040 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:21:00,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 211 flow [2025-04-26 16:21:00,109 INFO L116 PetriNetUnfolderBase]: 5/78 cut-off events. [2025-04-26 16:21:00,111 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:21:00,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 78 events. 5/78 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 276 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2025-04-26 16:21:00,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 88 transitions, 211 flow [2025-04-26 16:21:00,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 78 transitions, 186 flow [2025-04-26 16:21:00,119 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 89 places, 78 transitions, 186 flow [2025-04-26 16:21:00,128 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:00,128 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:00,128 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:00,128 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:00,128 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:00,128 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:00,128 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:00,128 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:00,130 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:26,419 INFO L131 ngComponentsAnalysis]: Automaton has 2981 accepting balls. 431469 [2025-04-26 16:21:26,419 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:26,419 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:26,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:26,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:26,424 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:26,424 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 433177 states, but on-demand construction may add more states [2025-04-26 16:21:37,853 INFO L131 ngComponentsAnalysis]: Automaton has 2981 accepting balls. 431469 [2025-04-26 16:21:37,853 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:37,854 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:37,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:37,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:37,862 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" [2025-04-26 16:21:37,867 INFO L754 eck$LassoCheckResult]: Loop: "[65] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[67] 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]" "[68] 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]" "[69] 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]" "[70] 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, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[71] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[72] 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]" "[73] 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, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[74] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" [2025-04-26 16:21:37,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 155745, now seen corresponding path program 1 times [2025-04-26 16:21:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:37,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866543680] [2025-04-26 16:21:37,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:37,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:37,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:37,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:37,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:37,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:38,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:38,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:38,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1350191588, now seen corresponding path program 1 times [2025-04-26 16:21:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:38,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490154182] [2025-04-26 16:21:38,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:38,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:38,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:38,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:38,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:38,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:38,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1487820164, now seen corresponding path program 1 times [2025-04-26 16:21:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:38,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848373044] [2025-04-26 16:21:38,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:38,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:21:38,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:21:38,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:38,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:21:38,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:21:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:38,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:38,313 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:38,313 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:38,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:38,314 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:38,314 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:38,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:38,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:38,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:38,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:38,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:38,315 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:38,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:38,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:38,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:38,447 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:38,454 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:38,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:38,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:38,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:38,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:38,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:38,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:38,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:38,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:38,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:38,505 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:38,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:21:38,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:38,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:38,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:21:38,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:38,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:38,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:38,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:38,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:38,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:38,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:38,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:38,545 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:38,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:21:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:38,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:38,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:38,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:21:38,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:38,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:38,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:38,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:38,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:38,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:38,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:38,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:38,581 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:38,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:38,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:38,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:38,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:21:38,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:38,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:38,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:38,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:38,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:38,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:38,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:38,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:38,650 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:38,650 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:38,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:38,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:38,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:38,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:21:38,664 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:38,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:38,698 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:38,698 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:38,699 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2025-04-26 16:21:38,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:21:38,725 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:21:38,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:38,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:38,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:38,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:38,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:38,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:38,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:38,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:38,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:38,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:38,956 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 [2025-04-26 16:21:38,962 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 433177 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0)