/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:53,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:53,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:53,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:53,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:53,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:53,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:53,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:53,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:53,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:53,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:53,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:53,899 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:53,899 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:53,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:53,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:53,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:53,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:53,901 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:53,901 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:53,902 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:54,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:54,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:54,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:54,149 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:54,150 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:54,152 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-3threads.bpl [2025-04-26 18:38:54,152 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl' [2025-04-26 18:38:54,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:54,176 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:54,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:54,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:54,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:54,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,229 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-04-26 18:38:54,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:54,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:54,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:54,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:54,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:54,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:54,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:54,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:54,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/1) ... [2025-04-26 18:38:54,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:54,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:54,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:54,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:38:54,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:54,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 18:38:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 18:38:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 18:38:54,296 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 18:38:54,327 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:54,329 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:54,393 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:54,393 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:54,405 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:54,405 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:54,406 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:54 BoogieIcfgContainer [2025-04-26 18:38:54,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:54,406 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:54,406 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:54,412 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:54,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:54,413 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:54" (1/2) ... [2025-04-26 18:38:54,414 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cebfc9 and model type array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:54, skipping insertion in model container [2025-04-26 18:38:54,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:54,414 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:54" (2/2) ... [2025-04-26 18:38:54,415 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-3threads.bpl [2025-04-26 18:38:54,476 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:38:54,509 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:54,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:54,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:54,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:54,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:38:54,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 129 flow [2025-04-26 18:38:54,598 INFO L116 PetriNetUnfolderBase]: 3/48 cut-off events. [2025-04-26 18:38:54,601 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:38:54,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 3/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-04-26 18:38:54,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 54 transitions, 129 flow [2025-04-26 18:38:54,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 48 transitions, 114 flow [2025-04-26 18:38:54,612 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 55 places, 48 transitions, 114 flow [2025-04-26 18:38:54,612 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 48 transitions, 114 flow [2025-04-26 18:38:54,749 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (in total 7662), 2565 states have internal predecessors, (7662), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:54,756 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (in total 7662), 2565 states have internal predecessors, (7662), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:54,759 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:54,996 WARN L140 AmpleReduction]: Number of pruned transitions: 526 [2025-04-26 18:38:54,997 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:38:54,997 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 10 [2025-04-26 18:38:54,997 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:69 [2025-04-26 18:38:54,997 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:361 [2025-04-26 18:38:54,997 WARN L145 AmpleReduction]: Times succ was already a loop node:29 [2025-04-26 18:38:54,997 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:20 [2025-04-26 18:38:54,997 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:54,998 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 441 states, 439 states have (on average 1.2277904328018223) internal successors, (in total 539), 440 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:55,008 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:55,008 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:55,008 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:55,009 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:55,009 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:55,009 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:55,009 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:55,009 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:55,012 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 441 states, 439 states have (on average 1.2277904328018223) internal successors, (in total 539), 440 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:55,029 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 364 [2025-04-26 18:38:55,030 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:55,030 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:55,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:38:55,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:55,034 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:55,035 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 441 states, 439 states have (on average 1.2277904328018223) internal successors, (in total 539), 440 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:55,045 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 364 [2025-04-26 18:38:55,045 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:55,045 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:55,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:38:55,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:55,050 INFO L752 eck$LassoCheckResult]: Stem: "[95] $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]" "[54] $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]" "[55] 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 18:38:55,050 INFO L754 eck$LassoCheckResult]: Loop: "[57] 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[]" "[59] 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]" "[60] 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]" "[61] 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]" "[62] 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]" "[63] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[64] 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] 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]" "[66] 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 18:38:55,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash 122815, now seen corresponding path program 1 times [2025-04-26 18:38:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:55,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519992897] [2025-04-26 18:38:55,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:55,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:55,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:55,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:55,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:55,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:55,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1174385188, now seen corresponding path program 1 times [2025-04-26 18:38:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:55,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456209583] [2025-04-26 18:38:55,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:55,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:55,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:55,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:55,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:55,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:55,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:55,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1932215262, now seen corresponding path program 1 times [2025-04-26 18:38:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:55,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256708069] [2025-04-26 18:38:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:55,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:55,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:55,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:55,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:55,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:55,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:55,344 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:55,345 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:55,345 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:55,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:55,346 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:55,346 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:55,346 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:55,346 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:55,346 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:38:55,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:55,346 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:55,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:55,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:55,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:55,512 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:55,516 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:55,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:55,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:55,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 18:38:55,521 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 18:38:55,522 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 18:38:55,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:55,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:55,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:55,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:55,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:55,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:55,551 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:55,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:55,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:55,559 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 18:38:55,561 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 18:38:55,562 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 18:38:55,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:55,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:55,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:55,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:55,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:55,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:55,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:55,580 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:55,585 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 18:38:55,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:55,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:55,588 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 18:38:55,589 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 18:38:55,590 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 18:38:55,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:55,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:55,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:55,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:55,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:55,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:55,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:55,603 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:55,609 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 18:38:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:55,612 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 18:38:55,612 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 18:38:55,614 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 18:38:55,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:55,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:55,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:55,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:55,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:55,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:55,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:55,641 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:38:55,641 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:38:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:55,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:55,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:38:55,647 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:55,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:38:55,665 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:38:55,665 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:55,666 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 18:38:55,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:38:55,676 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:38:55,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:55,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:55,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:55,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:55,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:55,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:55,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:55,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:55,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:55,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:55,777 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 18:38:55,793 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 18:38:55,795 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 441 states, 439 states have (on average 1.2277904328018223) internal successors, (in total 539), 440 states have internal predecessors, (539), 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) 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) [2025-04-26 18:38:55,892 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 441 states, 439 states have (on average 1.2277904328018223) internal successors, (in total 539), 440 states have internal predecessors, (539), 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). 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) Result 883 states and 1099 transitions. Complement of second has 6 states. [2025-04-26 18:38:55,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2025-04-26 18:38:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 18:38:55,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 3 letters. Loop has 9 letters. [2025-04-26 18:38:55,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:55,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 12 letters. Loop has 9 letters. [2025-04-26 18:38:55,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:55,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 3 letters. Loop has 18 letters. [2025-04-26 18:38:55,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:55,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1099 transitions. [2025-04-26 18:38:55,911 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 249 [2025-04-26 18:38:55,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 606 states and 750 transitions. [2025-04-26 18:38:55,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 361 [2025-04-26 18:38:55,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2025-04-26 18:38:55,921 INFO L74 IsDeterministic]: Start isDeterministic. Operand 606 states and 750 transitions. [2025-04-26 18:38:55,921 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:55,921 INFO L218 hiAutomatonCegarLoop]: Abstraction has 606 states and 750 transitions. [2025-04-26 18:38:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states and 750 transitions. [2025-04-26 18:38:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 594. [2025-04-26 18:38:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 594 states have (on average 1.2138047138047139) internal successors, (in total 721), 593 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 721 transitions. [2025-04-26 18:38:55,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 594 states and 721 transitions. [2025-04-26 18:38:55,958 INFO L438 stractBuchiCegarLoop]: Abstraction has 594 states and 721 transitions. [2025-04-26 18:38:55,958 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:55,958 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 594 states and 721 transitions. [2025-04-26 18:38:55,960 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 249 [2025-04-26 18:38:55,960 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:55,960 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:55,960 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:55,960 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:55,961 INFO L752 eck$LassoCheckResult]: Stem: "[95] $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]" "[54] $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]" "[55] 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]" "[56] L39-1-->sumFINAL: Formula: (<= v_N_2 |v_sumThread1of1ForFork0_i#1_3|) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" "[58] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[98] 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]" "[67] $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]" "[68] 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]" [2025-04-26 18:38:55,961 INFO L754 eck$LassoCheckResult]: Loop: "[70] 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[]" "[72] 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_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[73] 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]" "[74] 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]" "[75] 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 {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[77] 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]" "[78] 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 {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" [2025-04-26 18:38:55,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1435493982, now seen corresponding path program 1 times [2025-04-26 18:38:55,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:55,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212264085] [2025-04-26 18:38:55,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:55,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:55,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:55,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:55,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:55,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:55,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:55,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:55,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1317439337, now seen corresponding path program 1 times [2025-04-26 18:38:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:55,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183531861] [2025-04-26 18:38:55,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:55,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:55,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:55,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:55,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:55,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:55,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:55,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:55,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:55,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash 810726120, now seen corresponding path program 1 times [2025-04-26 18:38:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:55,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753247845] [2025-04-26 18:38:55,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:56,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:56,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:56,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:56,073 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 18:38:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:56,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753247845] [2025-04-26 18:38:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753247845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:56,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:38:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166143011] [2025-04-26 18:38:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:38:56,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:38:56,123 INFO L87 Difference]: Start difference. First operand 594 states and 721 transitions. cyclomatic complexity: 153 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:56,219 INFO L93 Difference]: Finished difference Result 632 states and 761 transitions. [2025-04-26 18:38:56,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 632 states and 761 transitions. [2025-04-26 18:38:56,222 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 276 [2025-04-26 18:38:56,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 632 states to 632 states and 761 transitions. [2025-04-26 18:38:56,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2025-04-26 18:38:56,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 398 [2025-04-26 18:38:56,225 INFO L74 IsDeterministic]: Start isDeterministic. Operand 632 states and 761 transitions. [2025-04-26 18:38:56,225 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:56,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 632 states and 761 transitions. [2025-04-26 18:38:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 761 transitions. [2025-04-26 18:38:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 599. [2025-04-26 18:38:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 599 states have (on average 1.2120200333889817) internal successors, (in total 726), 598 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 726 transitions. [2025-04-26 18:38:56,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 599 states and 726 transitions. [2025-04-26 18:38:56,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:38:56,239 INFO L438 stractBuchiCegarLoop]: Abstraction has 599 states and 726 transitions. [2025-04-26 18:38:56,239 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:56,239 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 599 states and 726 transitions. [2025-04-26 18:38:56,241 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 249 [2025-04-26 18:38:56,241 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:56,241 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:56,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:56,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:56,242 INFO L752 eck$LassoCheckResult]: Stem: "[95] $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]" "[54] $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]" "[55] 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]" "[57] 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[]" "[59] 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]" "[60] 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]" "[61] 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]" "[98] 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]" "[67] $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]" "[68] 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]" [2025-04-26 18:38:56,242 INFO L754 eck$LassoCheckResult]: Loop: "[70] 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[]" "[72] 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_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[73] 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]" "[74] 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]" "[75] 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 {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[77] 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]" "[78] 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 {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" [2025-04-26 18:38:56,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 55676577, now seen corresponding path program 1 times [2025-04-26 18:38:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:56,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642353402] [2025-04-26 18:38:56,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:56,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:56,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:56,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:56,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:56,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:56,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:56,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:56,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1317439337, now seen corresponding path program 2 times [2025-04-26 18:38:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:56,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522831237] [2025-04-26 18:38:56,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:56,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:56,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:56,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:56,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:56,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:56,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:56,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:56,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash -520393527, now seen corresponding path program 1 times [2025-04-26 18:38:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:56,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723036610] [2025-04-26 18:38:56,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:38:56,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:38:56,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:38:56,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:38:56,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:56,382 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:56,382 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:56,382 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:56,382 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:56,382 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:56,382 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,382 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:56,382 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:56,383 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:38:56,383 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:56,383 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:56,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:56,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:56,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:56,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:56,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:56,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:56,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:56,497 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:56,497 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:56,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:38:56,502 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 18:38:56,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:56,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:56,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:56,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:56,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:56,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:56,525 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:56,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:56,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:38:56,537 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 18:38:56,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:56,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:56,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:56,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:56,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:56,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:56,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:56,550 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:56,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,558 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:56,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:38:56,562 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 18:38:56,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:56,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:56,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:56,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:56,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:56,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:56,583 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:56,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:56,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,591 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:56,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:38:56,594 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 18:38:56,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:56,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:56,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:56,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:56,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:56,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:56,612 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:56,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:56,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,621 INFO L229 MonitoredProcess]: Starting monitored process 12 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 18:38:56,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:56,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:38:56,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:56,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:56,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:56,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:56,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:56,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:56,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:56,644 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:56,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:38:56,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,653 INFO L229 MonitoredProcess]: Starting monitored process 13 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 18:38:56,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:38:56,655 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 18:38:56,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:56,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:56,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:56,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:56,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:56,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:56,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:56,678 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:38:56,678 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:38:56,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:56,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,680 INFO L229 MonitoredProcess]: Starting monitored process 14 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 18:38:56,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:38:56,683 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:56,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:38:56,700 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:38:56,700 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:56,700 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2025-04-26 18:38:56,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:56,709 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:38:56,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:56,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:56,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:56,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:56,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:56,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:56,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:56,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:56,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:56,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:56,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:56,786 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 18:38:56,787 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 18:38:56,787 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 599 states and 726 transitions. cyclomatic complexity: 153 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:56,857 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 599 states and 726 transitions. cyclomatic complexity: 153. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1174 states and 1472 transitions. Complement of second has 6 states. [2025-04-26 18:38:56,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 18:38:56,859 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 10 letters. Loop has 9 letters. [2025-04-26 18:38:56,859 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:56,859 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 19 letters. Loop has 9 letters. [2025-04-26 18:38:56,860 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:56,860 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 10 letters. Loop has 18 letters. [2025-04-26 18:38:56,860 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:56,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1174 states and 1472 transitions. [2025-04-26 18:38:56,868 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 117 [2025-04-26 18:38:56,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1174 states to 775 states and 967 transitions. [2025-04-26 18:38:56,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2025-04-26 18:38:56,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 286 [2025-04-26 18:38:56,873 INFO L74 IsDeterministic]: Start isDeterministic. Operand 775 states and 967 transitions. [2025-04-26 18:38:56,873 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:56,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 775 states and 967 transitions. [2025-04-26 18:38:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states and 967 transitions. [2025-04-26 18:38:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 762. [2025-04-26 18:38:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 762 states have (on average 1.2322834645669292) internal successors, (in total 939), 761 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 939 transitions. [2025-04-26 18:38:56,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 762 states and 939 transitions. [2025-04-26 18:38:56,886 INFO L438 stractBuchiCegarLoop]: Abstraction has 762 states and 939 transitions. [2025-04-26 18:38:56,886 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:38:56,886 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 939 transitions. [2025-04-26 18:38:56,888 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 117 [2025-04-26 18:38:56,888 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:56,888 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:56,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:56,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:56,889 INFO L752 eck$LassoCheckResult]: Stem: "[95] $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]" "[54] $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]" "[55] 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]" "[56] L39-1-->sumFINAL: Formula: (<= v_N_2 |v_sumThread1of1ForFork0_i#1_3|) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" "[58] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[98] 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]" "[67] $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]" "[68] 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]" "[69] L39-1-->sumFINAL: Formula: (<= v_N_2 |v_sumThread1of1ForFork1_i#1_3|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_2} AuxVars[] AssignedVars[]" "[71] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[101] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_10|, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_14|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_x#1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_log_msg#1, sumThread1of1ForFork2_i#1]" "[80] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork2_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[81] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" [2025-04-26 18:38:56,889 INFO L754 eck$LassoCheckResult]: Loop: "[83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[]" "[85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" "[87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[91] 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_sumThread1of1ForFork2_log_msg#1_9|))) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" [2025-04-26 18:38:56,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash 488029410, now seen corresponding path program 1 times [2025-04-26 18:38:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:56,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436581700] [2025-04-26 18:38:56,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:56,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:56,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:56,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:56,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:56,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:56,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:56,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash -485703434, now seen corresponding path program 1 times [2025-04-26 18:38:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:56,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598129580] [2025-04-26 18:38:56,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:56,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:56,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:56,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:56,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:56,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:56,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:56,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:56,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:56,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1034555083, now seen corresponding path program 1 times [2025-04-26 18:38:56,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:56,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817164067] [2025-04-26 18:38:56,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:56,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:38:56,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:38:56,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:56,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:56,994 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 18:38:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:56,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817164067] [2025-04-26 18:38:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817164067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:56,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:56,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:38:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398836879] [2025-04-26 18:38:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:57,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:38:57,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:38:57,034 INFO L87 Difference]: Start difference. First operand 762 states and 939 transitions. cyclomatic complexity: 205 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (in total 22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:57,093 INFO L93 Difference]: Finished difference Result 770 states and 946 transitions. [2025-04-26 18:38:57,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 770 states and 946 transitions. [2025-04-26 18:38:57,096 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 117 [2025-04-26 18:38:57,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 770 states to 760 states and 936 transitions. [2025-04-26 18:38:57,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2025-04-26 18:38:57,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2025-04-26 18:38:57,099 INFO L74 IsDeterministic]: Start isDeterministic. Operand 760 states and 936 transitions. [2025-04-26 18:38:57,099 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:57,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 760 states and 936 transitions. [2025-04-26 18:38:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states and 936 transitions. [2025-04-26 18:38:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 758. [2025-04-26 18:38:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 758 states have (on average 1.2321899736147757) internal successors, (in total 934), 757 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 934 transitions. [2025-04-26 18:38:57,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 758 states and 934 transitions. [2025-04-26 18:38:57,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:38:57,116 INFO L438 stractBuchiCegarLoop]: Abstraction has 758 states and 934 transitions. [2025-04-26 18:38:57,116 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:38:57,116 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 758 states and 934 transitions. [2025-04-26 18:38:57,118 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 117 [2025-04-26 18:38:57,118 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:57,118 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:57,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:57,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:57,119 INFO L752 eck$LassoCheckResult]: Stem: "[95] $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]" "[54] $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]" "[55] 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]" "[57] 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[]" "[59] 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]" "[60] 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]" "[61] 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]" "[98] 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]" "[67] $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]" "[68] 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]" "[69] L39-1-->sumFINAL: Formula: (<= v_N_2 |v_sumThread1of1ForFork1_i#1_3|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_2} AuxVars[] AssignedVars[]" "[71] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[101] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_10|, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_14|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_x#1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_log_msg#1, sumThread1of1ForFork2_i#1]" "[80] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork2_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[81] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" [2025-04-26 18:38:57,119 INFO L754 eck$LassoCheckResult]: Loop: "[83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[]" "[85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" "[87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[91] 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_sumThread1of1ForFork2_log_msg#1_9|))) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" [2025-04-26 18:38:57,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash -836661437, now seen corresponding path program 1 times [2025-04-26 18:38:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:57,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921058228] [2025-04-26 18:38:57,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:57,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:57,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:57,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:57,151 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 18:38:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:57,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921058228] [2025-04-26 18:38:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921058228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:57,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:38:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282259155] [2025-04-26 18:38:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:57,151 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:57,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash -485703434, now seen corresponding path program 2 times [2025-04-26 18:38:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:57,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654516125] [2025-04-26 18:38:57,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:57,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:57,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:57,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:57,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:57,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:57,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:57,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:57,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:38:57,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:38:57,219 INFO L87 Difference]: Start difference. First operand 758 states and 934 transitions. cyclomatic complexity: 204 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (in total 15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:57,278 INFO L93 Difference]: Finished difference Result 758 states and 929 transitions. [2025-04-26 18:38:57,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 758 states and 929 transitions. [2025-04-26 18:38:57,281 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 117 [2025-04-26 18:38:57,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 758 states to 758 states and 929 transitions. [2025-04-26 18:38:57,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2025-04-26 18:38:57,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2025-04-26 18:38:57,284 INFO L74 IsDeterministic]: Start isDeterministic. Operand 758 states and 929 transitions. [2025-04-26 18:38:57,284 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:57,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 758 states and 929 transitions. [2025-04-26 18:38:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states and 929 transitions. [2025-04-26 18:38:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 756. [2025-04-26 18:38:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 756 states have (on average 1.2261904761904763) internal successors, (in total 927), 755 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 927 transitions. [2025-04-26 18:38:57,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 756 states and 927 transitions. [2025-04-26 18:38:57,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:38:57,300 INFO L438 stractBuchiCegarLoop]: Abstraction has 756 states and 927 transitions. [2025-04-26 18:38:57,300 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:38:57,300 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 756 states and 927 transitions. [2025-04-26 18:38:57,302 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 117 [2025-04-26 18:38:57,302 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:57,302 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:57,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:57,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:57,303 INFO L752 eck$LassoCheckResult]: Stem: "[95] $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]" "[54] $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]" "[55] 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]" "[57] 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[]" "[59] 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]" "[60] 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]" "[61] 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]" "[98] 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]" "[67] $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]" "[68] 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]" "[70] 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[]" "[72] 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_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[73] 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]" "[74] 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]" "[101] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_10|, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_14|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_x#1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_log_msg#1, sumThread1of1ForFork2_i#1]" "[80] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork2_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[81] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" [2025-04-26 18:38:57,303 INFO L754 eck$LassoCheckResult]: Loop: "[83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[]" "[85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" "[87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[91] 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_sumThread1of1ForFork2_log_msg#1_9|))) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" [2025-04-26 18:38:57,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash 17360674, now seen corresponding path program 1 times [2025-04-26 18:38:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:57,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951565811] [2025-04-26 18:38:57,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:57,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:57,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:57,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:57,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:57,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:57,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:57,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:57,326 INFO L85 PathProgramCache]: Analyzing trace with hash -485703434, now seen corresponding path program 3 times [2025-04-26 18:38:57,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:57,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927867181] [2025-04-26 18:38:57,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:38:57,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:57,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:57,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:57,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:38:57,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:57,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:57,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:57,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:57,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1301237493, now seen corresponding path program 1 times [2025-04-26 18:38:57,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:57,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264588473] [2025-04-26 18:38:57,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:57,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:38:57,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:38:57,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:57,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:38:57,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:38:57,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:57,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:57,525 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:57,525 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:57,525 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:57,525 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:57,525 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:57,525 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:57,525 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:57,525 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:57,525 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:38:57,525 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:57,525 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:57,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:57,695 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:57,695 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:57,700 INFO L229 MonitoredProcess]: Starting monitored process 15 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 18:38:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:38:57,701 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 18:38:57,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:57,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:57,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:57,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:57,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:57,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:57,715 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:57,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:38:57,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:57,723 INFO L229 MonitoredProcess]: Starting monitored process 16 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 18:38:57,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:38:57,726 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 18:38:57,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:57,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:57,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:57,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:57,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:57,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:57,741 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:57,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:57,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:57,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:57,749 INFO L229 MonitoredProcess]: Starting monitored process 17 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 18:38:57,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:38:57,753 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 18:38:57,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:57,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:57,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:57,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:57,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:57,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:57,767 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:57,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:38:57,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:57,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:57,775 INFO L229 MonitoredProcess]: Starting monitored process 18 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 18:38:57,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:38:57,778 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 18:38:57,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:57,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:57,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:57,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:57,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:57,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:57,799 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:57,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:57,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:57,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:57,807 INFO L229 MonitoredProcess]: Starting monitored process 19 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 18:38:57,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:38:57,810 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 18:38:57,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:57,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:57,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:57,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:57,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:38:57,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:38:57,826 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:57,830 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:38:57,830 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:38:57,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:57,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:57,832 INFO L229 MonitoredProcess]: Starting monitored process 20 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 18:38:57,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:38:57,834 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:57,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:57,851 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:38:57,851 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:57,851 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, sumThread1of1ForFork2_i#1) = 1*N - 1*sumThread1of1ForFork2_i#1 Supporting invariants [] [2025-04-26 18:38:57,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:57,858 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:38:57,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:57,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:57,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:57,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:57,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:57,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:57,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:57,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:57,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:57,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:57,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:57,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:57,955 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 18:38:57,955 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 18:38:57,956 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 756 states and 927 transitions. cyclomatic complexity: 199 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:57,999 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 756 states and 927 transitions. cyclomatic complexity: 199. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1426 states and 1804 transitions. Complement of second has 6 states. [2025-04-26 18:38:58,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 18:38:58,001 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 17 letters. Loop has 9 letters. [2025-04-26 18:38:58,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:58,001 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 26 letters. Loop has 9 letters. [2025-04-26 18:38:58,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:58,001 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 17 letters. Loop has 18 letters. [2025-04-26 18:38:58,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:58,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 1804 transitions. [2025-04-26 18:38:58,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:58,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 0 states and 0 transitions. [2025-04-26 18:38:58,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:38:58,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:38:58,007 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:38:58,007 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:58,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:58,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:58,007 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:58,007 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:38:58,007 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:38:58,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:58,007 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:38:58,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:38:58,019 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:58 BoogieIcfgContainer [2025-04-26 18:38:58,019 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:58,020 INFO L158 Benchmark]: Toolchain (without parser) took 3843.41ms. Allocated memory was 155.2MB in the beginning and 167.8MB in the end (delta: 12.6MB). Free memory was 83.9MB in the beginning and 73.3MB in the end (delta: 10.5MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. [2025-04-26 18:38:58,020 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.33ms. Allocated memory is still 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:58,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.48ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 81.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:58,020 INFO L158 Benchmark]: Boogie Preprocessor took 22.19ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 80.5MB in the end (delta: 950.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:58,020 INFO L158 Benchmark]: RCFGBuilder took 151.36ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 71.1MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:38:58,021 INFO L158 Benchmark]: BuchiAutomizer took 3612.59ms. Allocated memory was 155.2MB in the beginning and 167.8MB in the end (delta: 12.6MB). Free memory was 71.0MB in the beginning and 73.3MB in the end (delta: -2.3MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:58,021 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.33ms. Allocated memory is still 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.48ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 81.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.19ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 80.5MB in the end (delta: 950.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 151.36ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 71.1MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3612.59ms. Allocated memory was 155.2MB in the beginning and 167.8MB in the end (delta: 12.6MB). Free memory was 71.0MB in the beginning and 73.3MB in the end (delta: -2.3MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 182 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf100 lsp78 ukn74 mio100 lsp49 div100 bol100 ite100 ukn100 eq190 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 492, Number of transitions in reduction automaton: 539, Number of states in reduction automaton: 441, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:38:58,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...