/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/map-incr-split.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:13,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:13,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:13,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:13,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:13,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:13,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:13,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:13,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:13,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:13,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:13,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:13,226 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:13,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:13,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:13,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:13,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:13,227 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:13,228 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:13,228 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:13,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:13,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:13,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:13,469 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:13,469 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:13,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl [2025-04-26 18:39:13,472 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-split.bpl' [2025-04-26 18:39:13,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:13,489 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:13,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:13,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:13,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:13,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,524 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:13,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:13,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:13,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:13,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:13,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:13,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:13,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:13,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:13,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/1) ... [2025-04-26 18:39:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:13,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,575 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:39:13,577 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:39:13,599 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:13,600 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:13,600 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:13,600 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:39:13,635 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:13,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:13,705 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:13,705 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:13,711 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:13,711 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:13,712 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:13 BoogieIcfgContainer [2025-04-26 18:39:13,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:13,713 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:13,713 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:13,717 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:13,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:13,717 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:13" (1/2) ... [2025-04-26 18:39:13,718 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ff4a7be and model type map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:13, skipping insertion in model container [2025-04-26 18:39:13,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:13,718 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:13" (2/2) ... [2025-04-26 18:39:13,719 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-incr-split.bpl [2025-04-26 18:39:13,753 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:13,792 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:13,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,794 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:39:13,797 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:39:13,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 18:39:13,866 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-26 18:39:13,868 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:13,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-26 18:39:13,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 18:39:13,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-26 18:39:13,876 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 21 transitions, 54 flow [2025-04-26 18:39:13,877 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions, 54 flow [2025-04-26 18:39:13,889 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (in total 103), 54 states have internal predecessors, (103), 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:39:13,889 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (in total 103), 54 states have internal predecessors, (103), 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:39:13,891 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:13,926 WARN L140 AmpleReduction]: Number of pruned transitions: 22 [2025-04-26 18:39:13,926 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:13,926 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 7 [2025-04-26 18:39:13,926 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 18:39:13,926 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:20 [2025-04-26 18:39:13,926 WARN L145 AmpleReduction]: Times succ was already a loop node:3 [2025-04-26 18:39:13,926 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:9 [2025-04-26 18:39:13,927 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:13,927 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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:39:13,934 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:13,934 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:13,934 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:13,934 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:13,934 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:13,935 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:13,935 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:13,935 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:13,936 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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:39:13,944 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 18:39:13,945 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:13,945 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:13,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:39:13,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:13,948 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:13,948 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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:39:13,949 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 18:39:13,949 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:13,949 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:13,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:39:13,950 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:13,953 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[]" "[38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[64] L19-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 18:39:13,954 INFO L754 eck$LassoCheckResult]: Loop: "[52] L33-1-->L34: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[54] L34-->L35: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[55] L35-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 18:39:13,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2302668, now seen corresponding path program 1 times [2025-04-26 18:39:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101384843] [2025-04-26 18:39:13,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:14,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:14,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:14,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 81492, now seen corresponding path program 1 times [2025-04-26 18:39:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715976371] [2025-04-26 18:39:14,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash -120642647, now seen corresponding path program 1 times [2025-04-26 18:39:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511453880] [2025-04-26 18:39:14,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:14,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:14,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:14,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:14,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,196 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:14,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:14,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:14,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:14,197 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:14,198 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,198 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:14,198 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:14,198 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:14,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:14,198 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:14,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,362 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:14,366 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:14,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,369 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:39:14,370 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:39:14,372 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:39:14,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,399 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,405 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:39:14,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,408 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:39:14,409 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:39:14,411 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:39:14,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:14,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:14,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:14,424 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,433 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:39:14,434 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:39:14,434 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:39:14,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,472 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:14,492 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:14,492 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,534 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:39:14,535 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:39:14,536 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:14,552 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:39:14,552 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:14,552 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:14,553 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 18:39:14,559 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:39:14,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:14,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:14,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:14,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:14,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:14,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:14,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:14,606 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:14,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:14,632 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:39:14,646 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:14,648 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:14,731 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 94 states and 135 transitions. Complement of second has 6 states. [2025-04-26 18:39:14,731 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:39:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-26 18:39:14,741 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:39:14,741 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:14,741 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:39:14,742 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:14,742 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:39:14,742 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:14,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 135 transitions. [2025-04-26 18:39:14,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:39:14,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 35 states and 48 transitions. [2025-04-26 18:39:14,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-04-26 18:39:14,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-04-26 18:39:14,749 INFO L74 IsDeterministic]: Start isDeterministic. Operand 35 states and 48 transitions. [2025-04-26 18:39:14,749 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:14,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-04-26 18:39:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 48 transitions. [2025-04-26 18:39:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-04-26 18:39:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.375) internal successors, (in total 44), 31 states have internal predecessors, (44), 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:39:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2025-04-26 18:39:14,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-04-26 18:39:14,767 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-04-26 18:39:14,767 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:14,767 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2025-04-26 18:39:14,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:39:14,768 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:14,768 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:14,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:14,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:14,769 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[]" "[38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[64] L19-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[51] L33-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[53] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[67] L19-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[56] $Ultimate##0-->L45-1: Formula: (= v_N_4 v_thread2Thread1of1ForFork1_i_1) InVars {N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1, N=v_N_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:14,769 INFO L754 eck$LassoCheckResult]: Loop: "[58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[61] L47-->L45-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:14,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash 555014915, now seen corresponding path program 1 times [2025-04-26 18:39:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617601877] [2025-04-26 18:39:14,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:14,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:14,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:14,822 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:39:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:14,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617601877] [2025-04-26 18:39:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617601877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853602330] [2025-04-26 18:39:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:14,826 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:14,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 1 times [2025-04-26 18:39:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150850475] [2025-04-26 18:39:14,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:14,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:14,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:14,856 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:14,883 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2025-04-26 18:39:14,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2025-04-26 18:39:14,884 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:39:14,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 43 transitions. [2025-04-26 18:39:14,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-04-26 18:39:14,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-04-26 18:39:14,885 INFO L74 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2025-04-26 18:39:14,885 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:14,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-04-26 18:39:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2025-04-26 18:39:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-26 18:39:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (in total 43), 31 states have internal predecessors, (43), 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:39:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-04-26 18:39:14,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-04-26 18:39:14,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:14,892 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-04-26 18:39:14,892 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:14,892 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2025-04-26 18:39:14,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:39:14,892 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:14,892 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:14,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:14,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:14,893 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[]" "[38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[64] L19-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[52] L33-1-->L34: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[54] L34-->L35: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[67] L19-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[56] $Ultimate##0-->L45-1: Formula: (= v_N_4 v_thread2Thread1of1ForFork1_i_1) InVars {N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1, N=v_N_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[55] L35-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[51] L33-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:39:14,893 INFO L754 eck$LassoCheckResult]: Loop: "[58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[61] L47-->L45-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:14,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 822943039, now seen corresponding path program 1 times [2025-04-26 18:39:14,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434880788] [2025-04-26 18:39:14,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:14,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:14,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:14,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 2 times [2025-04-26 18:39:14,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269168044] [2025-04-26 18:39:14,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:14,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:14,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash 622806940, now seen corresponding path program 1 times [2025-04-26 18:39:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991663274] [2025-04-26 18:39:14,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:14,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:14,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:14,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:14,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:15,066 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:15,066 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:15,066 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:15,066 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:15,067 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:15,067 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,067 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:15,067 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:15,067 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:15,067 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:15,067 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:15,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,177 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:15,177 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:15,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,179 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:39:15,181 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:39:15,182 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:39:15,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,196 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,202 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:39:15,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,205 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:39:15,206 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:39:15,207 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:39:15,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:39:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,230 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:39:15,230 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:39:15,231 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:39:15,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,250 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:15,257 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:39:15,257 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:39:15,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,259 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:39:15,261 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:39:15,262 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:15,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:15,282 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:15,282 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:15,282 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 2*N Supporting invariants [] [2025-04-26 18:39:15,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:39:15,289 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:15,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:15,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:15,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:15,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:15,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:15,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:15,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:15,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:15,349 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:39:15,349 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:15,350 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:39:15,380 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 65 states and 89 transitions. Complement of second has 7 states. [2025-04-26 18:39:15,381 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:39:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:39:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 18:39:15,382 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:39:15,382 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,382 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:39:15,382 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,382 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 18:39:15,382 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 89 transitions. [2025-04-26 18:39:15,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 18:39:15,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 17 states and 19 transitions. [2025-04-26 18:39:15,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 18:39:15,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-04-26 18:39:15,383 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2025-04-26 18:39:15,383 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:15,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-26 18:39:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2025-04-26 18:39:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-26 18:39:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (in total 19), 16 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:39:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-04-26 18:39:15,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-26 18:39:15,384 INFO L438 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-26 18:39:15,384 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:15,384 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2025-04-26 18:39:15,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 18:39:15,385 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:15,385 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:15,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:15,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:15,385 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L17: Formula: (and (<= 0 v_k_1) (< v_k_1 (* 2 v_N_6))) InVars {k=v_k_1, N=v_N_6} OutVars{k=v_k_1, N=v_N_6} AuxVars[] AssignedVars[]" "[38] L17-->L19: Formula: (= (select v_A_5 v_k_2) v_ULTIMATE.start_x_1) InVars {A=v_A_5, k=v_k_2} OutVars{A=v_A_5, ULTIMATE.start_x=v_ULTIMATE.start_x_1, k=v_k_2} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[64] L19-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[52] L33-1-->L34: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[54] L34-->L35: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[55] L35-->L33-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[51] L33-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[53] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[67] L19-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[56] $Ultimate##0-->L45-1: Formula: (= v_N_4 v_thread2Thread1of1ForFork1_i_1) InVars {N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1, N=v_N_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:15,385 INFO L754 eck$LassoCheckResult]: Loop: "[58] L45-1-->L46: Formula: (< v_thread2Thread1of1ForFork1_i_5 (* 2 v_N_5)) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[60] L46-->L47: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ (select v_A_4 v_thread2Thread1of1ForFork1_i_7) 1)) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[61] L47-->L45-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 18:39:15,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash -269802144, now seen corresponding path program 1 times [2025-04-26 18:39:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:15,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463731276] [2025-04-26 18:39:15,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:15,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:15,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:15,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:15,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:15,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:15,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:15,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 3 times [2025-04-26 18:39:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:15,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856702665] [2025-04-26 18:39:15,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:15,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:15,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:15,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:15,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:15,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:15,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:15,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1791803429, now seen corresponding path program 1 times [2025-04-26 18:39:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:15,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321115671] [2025-04-26 18:39:15,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:15,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:15,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:15,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:15,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:15,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:15,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:15,529 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:15,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:15,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:15,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:15,530 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:15,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:15,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:15,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-incr-split.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:39:15,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:15,530 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:15,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,643 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:15,644 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,646 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:39:15,646 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:39:15,647 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:39:15,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,661 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,666 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:39:15,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,668 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:39:15,670 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:39:15,671 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:39:15,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:15,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:15,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:15,682 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,687 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:39:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,689 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:39:15,690 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:39:15,691 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:39:15,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,704 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:39:15,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,713 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:39:15,714 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:39:15,716 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:39:15,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:15,742 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:15,742 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:15,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,745 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:39:15,746 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:39:15,747 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:15,762 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:39:15,763 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:15,763 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:15,763 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 2*N Supporting invariants [] [2025-04-26 18:39:15,768 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:39:15,769 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:15,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:15,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:15,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:15,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:15,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:15,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:15,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:15,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:15,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:15,813 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:39:15,813 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:15,814 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:39:15,828 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 22 states and 26 transitions. Complement of second has 4 states. [2025-04-26 18:39:15,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:39:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-04-26 18:39:15,829 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:39:15,829 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,829 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:39:15,830 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,830 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 18:39:15,830 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2025-04-26 18:39:15,830 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:15,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2025-04-26 18:39:15,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:15,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:15,830 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:15,830 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:15,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:15,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:15,830 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:15,830 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:15,831 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:15,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:15,831 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:15,842 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:39:15,843 INFO L201 PluginConnector]: Adding new model map-incr-split.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:15 BoogieIcfgContainer [2025-04-26 18:39:15,843 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:15,844 INFO L158 Benchmark]: Toolchain (without parser) took 2354.65ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 85.3MB in the beginning and 68.3MB in the end (delta: 17.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:15,844 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.95ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:15,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.85ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:15,844 INFO L158 Benchmark]: Boogie Preprocessor took 20.43ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:15,845 INFO L158 Benchmark]: RCFGBuilder took 165.38ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:15,845 INFO L158 Benchmark]: BuchiAutomizer took 2130.54ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 73.1MB in the beginning and 68.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:15,848 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.95ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.85ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.43ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 165.38ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 73.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2130.54ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 73.1MB in the beginning and 68.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 40 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital59 mio100 ax100 hnf100 lsp85 ukn69 mio100 lsp82 div100 bol100 ite100 ukn100 eq135 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 139, Number of transitions in reduction automaton: 61, Number of states in reduction automaton: 45, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 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 2 * N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * N + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:15,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...